Task: | Witch game |
Sender: | marian |
Submission time: | 2017-01-22 17:20:19 +0200 |
Language: | C++ |
Status: | READY |
Result: | 47 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 23 |
#2 | ACCEPTED | 24 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.04 s | 1 | details |
#4 | ACCEPTED | 0.03 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.15 s | 2 | details |
#7 | ACCEPTED | 0.13 s | 2 | details |
#8 | ACCEPTED | 0.12 s | 2 | details |
#9 | ACCEPTED | 0.12 s | 2 | details |
#10 | ACCEPTED | 0.17 s | 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> using namespace std; int n, x[100000], ingoing[100000]; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> x[i]; x[i]--; ingoing[x[i]]++; } long long res = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (i == j || x[i] == j || x[j] == i) continue; int cur = n - 4 - ingoing[i] - ingoing[j]; if (x[i] == x[j]) cur++; if (x[x[i]] == i || x[x[i]] == j) cur++; if (x[j] != x[i] && (x[x[j]] == i || x[x[j]] == j)) cur++; res += (long long) cur; //cout << i << " " << j << " " << cur << "\n"; } } cout << res / 6 << "\n"; }
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: ACCEPTED
input |
---|
5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
correct output |
---|
20808340000 |
user output |
---|
20808340000 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
5000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
correct output |
---|
20795850000 |
user output |
---|
20795850000 |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
20808342499 |
user output |
---|
20808342499 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
5000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
correct output |
---|
20795848337 |
user output |
---|
20795848337 |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
5000 283 2880 2565 3289 4160 936 39... |
correct output |
---|
20795852465 |
user output |
---|
20795852465 |
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) |