| Task: | Witch game |
| Sender: | nigus |
| Submission time: | 2017-01-19 22:48:17 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.04 s | 1 | details |
| #3 | ACCEPTED | 0.04 s | 1 | details |
| #4 | WRONG ANSWER | 0.04 s | 1 | details |
| #5 | ACCEPTED | 0.05 s | 1 | details |
| #6 | WRONG ANSWER | 0.07 s | 2 | details |
| #7 | WRONG ANSWER | 0.06 s | 2 | details |
| #8 | WRONG ANSWER | 0.09 s | 2 | details |
| #9 | WRONG ANSWER | 0.08 s | 2 | details |
| #10 | WRONG ANSWER | 0.09 s | 2 | details |
| #11 | WRONG ANSWER | 0.29 s | 3 | details |
| #12 | WRONG ANSWER | 0.53 s | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | WRONG ANSWER | 0.53 s | 3 | details |
| #15 | WRONG ANSWER | 0.58 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:19:14: warning: unused variable 'c3' [-Wunused-variable]
ll c1,c2,c3,c4,c5;
^
input/code.cpp:19:17: warning: unused variable 'c4' [-Wunused-variable]
ll c1,c2,c3,c4,c5;
^
input/code.cpp:19:20: warning: unused variable 'c5' [-Wunused-variable]
ll c1,c2,c3,c4,c5;
^Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007ll;
int n,m,k,x,y;
vector<ll> A;
vector<vector<ll> > C(100001 , vector<ll>());
ll deg[100001] = {0};
vector<set<ll> > CS;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ll c1,c2,c3,c4,c5;
ll a,b,c;
cin >> n;
for(c1 = 0; c1 < n; c1++){
cin >> a;
A.push_back(a-1);
set<ll> S1;
CS.push_back(S1);
}
for(c1 = 0; c1 < n; c1++){
a = A[c1];
if(c1 < a || A[a] != c1){
//cout << c1 << "\n";
deg[a]++;
deg[c1]++;
C[a].push_back(c1);
C[c1].push_back(a);
CS[a].insert(c1);
CS[c1].insert(a);
}
}
ll ans = (n * (n-1) * (n-2)) / 6;
ll trip = 0;
ll things = 0;
ll tria = 0;
for(c1 = 0; c1 < n; c1++){
a = A[c1];
if(c1 < a || A[a] != c1){
if(deg[a] < deg[c1]){
b = c1;
}
else{
b = a;
a = c1;
}
ll inter = deg[a] - 1;
bool mark[100001] = {0};
inter = 0;
for(c2 = 0; c2 < deg[a]; c2++){
c = C[a][c2];
if(c != a && c != b){
if(mark[c] == 0)inter++;
mark[c] = 1;
}
}
for(c2 = 0; c2 < deg[b]; c2++){
c = C[b][c2];
if(c != a && c != b){
if(mark[c] == 0)inter++;
if(mark[c] == 1)tria++;
mark[c] = 1;
}
}
/*
for(c2 = 0; c2 < deg[b]; c2++){
c = C[b][c2];
if(c != a){
if(CS[a].find(c) == CS[a].end()){
inter++;
}
}
}
*/
//cout << a+1 << " " << b+1 << " , " << inter << "\n";
ll thing = n-2;
thing -= inter;
things += thing;
trip += inter;
}
}
for(c1 = 0; c1 < n; c1++){
if(A[c1] > c1 && A[A[c1]] > A[c1] && A[A[A[c1]]] == c1)tria++;
}
tria /= 3;
trip -= tria;
trip /= 2;
things += trip;
ans -= things;
cout << ans << "\n";
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: WRONG ANSWER
| input |
|---|
| 100 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 151968 |
| user output |
|---|
| 151974 |
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: WRONG ANSWER
| input |
|---|
| 5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 20808340000 |
| user output |
|---|
| 49331402 |
Test 7
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 5000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 20795850000 |
| user output |
|---|
| 36841402 |
Test 8
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 20808342499 |
| user output |
|---|
| 49333901 |
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 |
|---|
| 36840017 |
Test 10
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 5000 283 2880 2565 3289 4160 936 39... |
| correct output |
|---|
| 20795852465 |
| user output |
|---|
| 36843867 |
Test 11
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 166656666800000 |
| user output |
|---|
| -5244153984 |
Test 12
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 166651667000000 |
| user output |
|---|
| -10243953984 |
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: WRONG ANSWER
| input |
|---|
| 100000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 166651666966668 |
| user output |
|---|
| -10243981760 |
Test 15
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 186 62491 95379 37431 88427 93... |
| correct output |
|---|
| 166651667250100 |
| user output |
|---|
| -10243703884 |