| Task: | Witch game |
| Sender: | koosaga |
| Submission time: | 2017-01-21 08:47:44 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1 | details |
| #2 | ACCEPTED | 0.05 s | 1 | details |
| #3 | ACCEPTED | 0.04 s | 1 | details |
| #4 | WRONG ANSWER | 0.04 s | 1 | details |
| #5 | WRONG ANSWER | 0.04 s | 1 | details |
| #6 | WRONG ANSWER | 0.21 s | 2 | details |
| #7 | ACCEPTED | 0.18 s | 2 | details |
| #8 | ACCEPTED | 0.21 s | 2 | details |
| #9 | WRONG ANSWER | 0.18 s | 2 | details |
| #10 | ACCEPTED | 0.19 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:23:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
input/code.cpp:26:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&p);
^Code
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
int n;
vector<int> gph[100005];
vector<int> dfn;
int vis[100005], sz[100005];
void dfs(int x){
if(vis[x]) return;
vis[x] = 1;
dfn.push_back(x);
for(auto &i : gph[x]) dfs(i);
}
lint nc2(lint x){
return x * (x-1) / 2;
}
int main(){
scanf("%d",&n);
for(int i=1; i<=n; i++){
int p;
scanf("%d",&p);
gph[i].push_back(p);
gph[p].push_back(i);
}
for(int i=1; i<=n; i++){
if(!vis[i]){
dfn.clear();
dfs(i);
for(auto &j : dfn){
sz[j] = dfn.size();
}
}
}
lint ans = 0;
int chk[100005];
for(int i=1; i<=n; i++){
ans += nc2(n - gph[i].size() - 1);
memset(chk, 0, sizeof(chk));
ans -= n;
int cyc3 = 0;
for(auto &j : gph[i]){
if(chk[j]) cyc3++;
chk[j] = 1;
ans += gph[j].size();
}
if(cyc3) ans-=2;
}
cout << ans/3;
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 100 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 156800 |
| user output |
|---|
| 151933 |
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: WRONG ANSWER
| input |
|---|
| 100 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 151968 |
| user output |
|---|
| 152001 |
Test 5
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 100 8 98 100 62 42 36 95 70 22 49 ... |
| correct output |
|---|
| 152040 |
| user output |
|---|
| 152041 |
Test 6
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 20808340000 |
| user output |
|---|
| 20795846666 |
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: WRONG ANSWER
| input |
|---|
| 5000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 20795848337 |
| user output |
|---|
| 20795850003 |
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) |
