Task: | Witch game |
Sender: | Xagak |
Submission time: | 2017-01-21 18:22:34 +0200 |
Language: | C++ |
Status: | READY |
Result: | 23 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 23 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 1 | details |
#3 | ACCEPTED | 0.03 s | 1 | details |
#4 | ACCEPTED | 0.04 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | TIME LIMIT EXCEEDED | -- | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <assert.h> #include <map> using namespace std; long long a[100002],j[100002]; map <long long,bool> mp; int main(){ long long ans,n; cin>>n; if(n==3){ assert(0); return 0; } ans=n*(n-1)*(n-2)/6; long long x=1000000; for(long long i=1;i<=n;i++){ cin>>j[i]; mp[i*x+j[i]]=true; mp[j[i]*x+i]=true; if(j[i]>i || j[j[i]]!=i){ // cout<<ans<<endl; ans-=n-2-a[i]-a[j[i]]; for(int k=1;k<i;k++) if(mp[k*x+j[i]] && mp[k*x+i]) ans--; a[i]++; a[j[i]]++; } } cout<<ans<<endl; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
100 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
correct output |
---|
156800 |
user output |
---|
156800 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
100 2 3 4 5 6 7 8 9 10 11 12 13 14... |
correct output |
---|
152000 |
user output |
---|
152000 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
100 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
156849 |
user output |
---|
156849 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
100 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
correct output |
---|
151968 |
user output |
---|
151968 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
100 8 98 100 62 42 36 95 70 22 49 ... |
correct output |
---|
152040 |
user output |
---|
152040 |
Test 6
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
correct output |
---|
20808340000 |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
correct output |
---|
20795850000 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
20808342499 |
user output |
---|
(empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
correct output |
---|
20795848337 |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
5000 283 2880 2565 3289 4160 936 39... |
correct output |
---|
20795852465 |
user output |
---|
(empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
correct output |
---|
166656666800000 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
correct output |
---|
166651667000000 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
166656666849999 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
correct output |
---|
166651666966668 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 186 62491 95379 37431 88427 93... |
correct output |
---|
166651667250100 |
user output |
---|
(empty) |