Submission #1693146
Source Code Expand
#include<iostream> #include<iomanip> #include<map> #include<set> #include<string> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<stack> using namespace std; #define P(p) cout<<(p)<<endl #define rep(i,m,n) for(int i = (m); i < (int)(n); i++) #define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--) #define vsort(v) sort(v.begin(), v.end()); #define rvsort(v) sort(v.begin(), v.end(),greater<int>()); #define YES cout<<"YES"<< endl #define NO cout<<"NO"<<endl #define Yes cout<<"Yes"<<endl #define No cout<<"No"<<endl #define yes cout<<"yes"<<endl #define no cout<<"no"<<endl #define ret return #define C(i) cin>>i #define C2(i,j) cin>>i>>j #define C3(i,j,k) cin>>i>>j>>k #define C4(i,j,k,m) cin>>i>>j>>k>>m //////////////////////////////////////////////////////////// int solve(vector<int> &v){ bool f[v.size()] = {}; //omote = false //ura = true rep(i,0,v.size()){ rep(j,i+1,v.size()){ if(v[j]%v[i] == 0){ if(f[j]) f[j] = false; else f[j] = true; } } } int sum = 0; rep(i,0,v.size()){ if(!f[i]) sum++; } ret sum; } int main(){ int n; cin >> n; vector<int> v; rep(i,0,n){ int c; cin >> c; v.push_back(c); } vsort(v); long sum_m = 0; long sum_k = 0; do{ sum_k++; sum_m += solve(v); //printf("m:%ld k:%ld \n",sum_m , sum_k); }while(next_permutation(v.begin() , v.end() )); double d = (double)sum_m / sum_k; printf("%.15f\n",d); ret 0; }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | walk_to_work |
Language | C++14 (GCC 5.4.1) |
Score | 99 |
Code Size | 1591 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 |
|
|
|
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 | 2 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 8 ms | 256 KB |
subtask1_05.txt | AC | 9 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 6 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 8 ms | 256 KB |
subtask1_11.txt | AC | 2 ms | 256 KB |
subtask1_12.txt | AC | 6 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 6 ms | 256 KB |
subtask1_16.txt | AC | 6 ms | 256 KB |
subtask1_17.txt | AC | 11 ms | 256 KB |
subtask1_18.txt | AC | 4 ms | 256 KB |
subtask1_19.txt | AC | 9 ms | 256 KB |
subtask1_20.txt | AC | 9 ms | 256 KB |
subtask2_01.txt | AC | 761 ms | 256 KB |
subtask2_02.txt | AC | 1 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 |