| Task: | Witch game |
| Sender: | abcdef6199 |
| Submission time: | 2017-01-22 09:49:04 +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.04 s | 1 | details |
| #5 | ACCEPTED | 0.04 s | 1 | details |
| #6 | ACCEPTED | 0.14 s | 2 | details |
| #7 | ACCEPTED | 0.17 s | 2 | details |
| #8 | ACCEPTED | 0.14 s | 2 | details |
| #9 | ACCEPTED | 0.17 s | 2 | details |
| #10 | ACCEPTED | 0.18 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 |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:17:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
input/code.cpp:18:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
^Code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> II;
const int N = (int) 1e5 + 10;
int n, a[N];
bool mark[N];
int main() {
#ifdef LOCAL
freopen("Data.inp", "r", stdin);
freopen("Data.out", "w", stdout);
#endif
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
LL ans = 0;
for (int z = 1; z <= n; ++z) {
int c1 = 0, c2 = 0;
for (int i = 1; i <= n; ++i) {
mark[i] = a[z] != i && a[i] != z;
c1 += mark[i] && i < z;
c2 += mark[i] && i > z;
}
LL sum = c1 * c2;
for (int i = 1; i <= z - 1; ++i)
if (mark[i] && mark[a[i]] && a[i] > z) sum--;
for (int i = z + 1; i <= n; ++i)
if (mark[i] && mark[a[i]] && a[i] < z) sum--;
for (int i = 1; i <= z - 1; ++i)
if (mark[i] && mark[a[i]] && a[i] > z && a[a[i]] == i) sum++;
ans += sum;
}
cout << ans;
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: 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) |
