Submission #169812


Source Code Expand

Copy
#include <cstdio>
#include <cstring>
#include <cassert>
#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <iterator>
#include <queue>
#include <utility>

using namespace std;

int N;
#define whole(xs) xs.begin(), xs.end()

typedef pair<int, bool> P;
vector<P> C;

int fact(int n) {
    if (n == 0) return 1;
    return n * fact(n - 1);
}

int dfs(vector<P>& v) {
    int Ans = 0;
    for (int i = 0; i < v.size(); i++) {
        vector<P> Next;
        for (int j = 0; j < v.size(); j++) {
            if (i == j) continue;
            if (v[j].first % v[i].first == 0) {
                Next.push_back(make_pair(v[j].first, !v[j].second));
            } else {
                Next.push_back(v[j]);
            }
        }
        Ans += dfs(Next) + fact(v.size() - 1) * v[i].second;
    }
    return Ans;
}

int main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        int c; cin >> c;
        C.push_back(make_pair(c, true));
    }
    double Ans = dfs(C);
    int Div = 1;
    for (int i = 1; i <= N; i++) {
        Div *= i;
    }
    printf("%.9f\n", Ans / Div);
    return 0;
}

Submission Info

Submission Time
Task C - コイン
User izuru
Language C++ (G++ 4.6.4)
Score 99
Code Size 1224 Byte
Status TLE
Exec Time 2033 ms
Memory 940 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 3
AC × 20
AC × 21
TLE × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 22 ms 924 KB
sample_02.txt AC 22 ms 676 KB
sample_03.txt AC 20 ms 900 KB
subtask1_01.txt AC 21 ms 804 KB
subtask1_02.txt AC 20 ms 924 KB
subtask1_03.txt AC 21 ms 924 KB
subtask1_04.txt AC 32 ms 804 KB
subtask1_05.txt AC 33 ms 844 KB
subtask1_06.txt AC 23 ms 924 KB
subtask1_07.txt AC 31 ms 796 KB
subtask1_08.txt AC 21 ms 676 KB
subtask1_09.txt AC 20 ms 804 KB
subtask1_10.txt AC 31 ms 924 KB
subtask1_11.txt AC 22 ms 760 KB
subtask1_12.txt AC 30 ms 804 KB
subtask1_13.txt AC 22 ms 732 KB
subtask1_14.txt AC 22 ms 796 KB
subtask1_15.txt AC 32 ms 800 KB
subtask1_16.txt AC 31 ms 800 KB
subtask1_17.txt AC 32 ms 732 KB
subtask1_18.txt AC 31 ms 800 KB
subtask1_19.txt AC 32 ms 804 KB
subtask1_20.txt AC 32 ms 800 KB
subtask2_01.txt AC 895 ms 800 KB
subtask2_02.txt TLE 2029 ms 804 KB
subtask2_03.txt TLE 2032 ms 804 KB
subtask2_04.txt TLE 2030 ms 928 KB
subtask2_05.txt TLE 2031 ms 932 KB
subtask2_06.txt TLE 2030 ms 940 KB
subtask2_07.txt TLE 2029 ms 928 KB
subtask2_08.txt TLE 2030 ms 936 KB
subtask2_09.txt TLE 2033 ms 924 KB
subtask2_10.txt TLE 2029 ms 936 KB
subtask2_11.txt TLE 2030 ms 928 KB
subtask2_12.txt TLE 2029 ms 888 KB
subtask2_13.txt TLE 2032 ms 884 KB
subtask2_14.txt TLE 2029 ms 924 KB
subtask2_15.txt TLE 2029 ms 924 KB
subtask2_16.txt TLE 2030 ms 932 KB
subtask2_17.txt TLE 2029 ms 932 KB
subtask2_18.txt TLE 2029 ms 932 KB
subtask2_19.txt TLE 2029 ms 864 KB
subtask2_20.txt TLE 2030 ms 932 KB