Submission #6791610


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int main(){
int N; cin >> N;
  vector<int> A(N);
 for(int i = 0; i < N; i++){ cin >> A[i];}
  long double ans = 0;
  vector<int> arr(N);
  for(int i = 0; i < N; i++){  arr[i] = i;}
  int cnt = 0; // cnt means the counter of do-while( == N!)
  do{cnt++;
    vector<bool> flip(N,true);
    //true means a coin is on the above side while false means the opposite
    for(int i = 0; i < N - 1; i++){
      for(int j = i + 1; j < N; j++){
        if( !(A[arr[j]] % A[arr[i]])){ flip[arr[j]] = !flip[arr[j]];}
      }}
    
    for(int i = 0; i < N; i++){
      if(flip[i]){ ans++;}
    }
     
   
  }while( next_permutation(arr.begin(),arr.end()));
  
  cout << fixed << setprecision(10) << ans / cnt << endl; return 0;
}
  

Submission Info

Submission Time
Task C - コイン
User youyin
Language C++14 (GCC 5.4.1)
Score 99
Code Size 796 Byte
Status TLE
Exec Time 2103 ms
Memory 256 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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 10 ms 256 KB
subtask1_05.txt AC 11 ms 256 KB
subtask1_06.txt AC 3 ms 256 KB
subtask1_07.txt AC 8 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 10 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 8 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 2 ms 256 KB
subtask1_15.txt AC 13 ms 256 KB
subtask1_16.txt AC 8 ms 256 KB
subtask1_17.txt AC 14 ms 256 KB
subtask1_18.txt AC 13 ms 256 KB
subtask1_19.txt AC 12 ms 256 KB
subtask1_20.txt AC 12 ms 256 KB
subtask2_01.txt AC 922 ms 256 KB
subtask2_02.txt TLE 2103 ms 256 KB
subtask2_03.txt TLE 2103 ms 256 KB
subtask2_04.txt TLE 2103 ms 256 KB
subtask2_05.txt TLE 2103 ms 256 KB
subtask2_06.txt TLE 2103 ms 256 KB
subtask2_07.txt TLE 2103 ms 256 KB
subtask2_08.txt TLE 2103 ms 256 KB
subtask2_09.txt TLE 2103 ms 256 KB
subtask2_10.txt TLE 2103 ms 256 KB
subtask2_11.txt TLE 2103 ms 256 KB
subtask2_12.txt TLE 2103 ms 256 KB
subtask2_13.txt TLE 2103 ms 256 KB
subtask2_14.txt TLE 2103 ms 256 KB
subtask2_15.txt TLE 2103 ms 256 KB
subtask2_16.txt TLE 2103 ms 256 KB
subtask2_17.txt TLE 2103 ms 256 KB
subtask2_18.txt TLE 2103 ms 256 KB
subtask2_19.txt TLE 2103 ms 256 KB
subtask2_20.txt TLE 2103 ms 256 KB