Contest Duration: - (local time) (120 minutes) Back to Home

Submission #169256

Source Code Expand

Copy
```#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

int main(){
int n;
cin>>n;
vector<pair<ll,int> > vv(n);
rep(i,n){
cin>>vv[i].F;
}
ll c=0;
ll S=0;
sort(ALL(vv));
do{
c++;
int t=S;
vector<pair<ll,int> > v(n);
v=vv;
rep(i,n){
v[i].S=0;
}
//cout<<endl;

rep(i,n){
for(int j=i+1;j<n;j++){
if(v[j].F%v[i].F==0){
//cout<<"hoge"<<endl;
v[j].S=1-v[j].S;
}
}
//rep(j,n){
//cout<<v[i].S<<" ";
//}
//cout<<endl;
}
rep(i,n){
//cout<<v[i].S<<" ";
if(!v[i].S) S++;
}
//cout<<endl;
//cout<<S-t<<endl;
}while(next_permutation(ALL(vv)));
//cout<<S<<endl;
//cout<<c<<endl;
printf("%.10lf\n",(double)S/c);
return 0;
}```

Submission Info

Submission Time 2014-05-10 21:34:20+0900 C - コイン j_gui0121 C++ (G++ 4.6.4) 99 1359 Byte TLE 2036 ms 932 KB

Judge Result

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
Case Name Status Exec Time Memory
sample_01.txt AC 22 ms 924 KB
sample_02.txt AC 21 ms 804 KB
sample_03.txt AC 21 ms 800 KB
subtask1_01.txt AC 21 ms 804 KB
subtask1_02.txt AC 21 ms 812 KB
subtask1_03.txt AC 20 ms 932 KB
subtask1_04.txt AC 48 ms 916 KB
subtask1_05.txt AC 47 ms 804 KB
subtask1_06.txt AC 23 ms 808 KB
subtask1_07.txt AC 45 ms 800 KB
subtask1_08.txt AC 21 ms 928 KB
subtask1_09.txt AC 21 ms 800 KB
subtask1_10.txt AC 46 ms 800 KB
subtask1_11.txt AC 20 ms 928 KB
subtask1_12.txt AC 44 ms 756 KB
subtask1_13.txt AC 21 ms 800 KB
subtask1_14.txt AC 20 ms 928 KB
subtask1_15.txt AC 35 ms 796 KB
subtask1_16.txt AC 44 ms 804 KB
subtask1_17.txt AC 49 ms 804 KB
subtask1_18.txt AC 28 ms 812 KB
subtask1_19.txt AC 48 ms 804 KB
subtask1_20.txt AC 48 ms 808 KB
subtask2_01.txt TLE 2029 ms 804 KB
subtask2_02.txt AC 21 ms 804 KB
subtask2_03.txt TLE 2029 ms 804 KB
subtask2_04.txt TLE 2029 ms 804 KB
subtask2_05.txt TLE 2029 ms 796 KB
subtask2_06.txt TLE 2029 ms 796 KB
subtask2_07.txt TLE 2029 ms 872 KB
subtask2_08.txt TLE 2029 ms 800 KB
subtask2_09.txt TLE 2031 ms 916 KB
subtask2_10.txt TLE 2029 ms 812 KB
subtask2_11.txt TLE 2033 ms 792 KB
subtask2_12.txt TLE 2029 ms 808 KB
subtask2_13.txt TLE 2036 ms 792 KB
subtask2_14.txt TLE 2029 ms 808 KB
subtask2_15.txt TLE 2029 ms 848 KB
subtask2_16.txt TLE 2029 ms 808 KB
subtask2_17.txt TLE 2029 ms 804 KB
subtask2_18.txt TLE 2029 ms 812 KB
subtask2_19.txt TLE 2029 ms 884 KB
subtask2_20.txt TLE 2029 ms 808 KB