CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:herkar
Submission time:2017-01-22 16:03:55 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED23
#2ACCEPTED24
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.05 s2details
#9ACCEPTED0.03 s2details
#10ACCEPTED0.05 s2details
#11ACCEPTED0.09 s3details
#12ACCEPTED0.10 s3details
#13ACCEPTED0.09 s3details
#14ACCEPTED0.08 s3details
#15ACCEPTED0.09 s3details

Code

#include <functional>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < int(b); ++i)
#define rrep(i,a,b) for(int i = (b); i --> int(a); )
#define trav(i,v) for(auto&i:v)
#define all(c) (c).begin(), (c).end()
#define sz(c) int((c).size())
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
	cin.tie(0);
	cin.sync_with_stdio(0);
	ll n;
	cin >> n;
	set<pii> E;
	vi v(n),c(n);
	rep(i,0,n){
		int j;
		cin >> j;
		--j;
		v[i] = j;
		pii e = {min(i,j),max(i,j)};
		if(E.find(e) == E.end()) E.insert(e);
	}
	ll ans = 0;
	rep(i,0,n)
		ans += i == v[v[v[i]]];
	ans /= 3;
	trav(i,E)
		ans += n-2-c[i.first]++-c[i.second]++;

	cout << n*(n-1)*(n-2)/6-ans << endl;
}

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: ACCEPTED

input
100000
2 1 4 3 6 5 8 7 10 9 12 11 14 ...

correct output
166656666800000

user output
166656666800000

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 3 4 5 6 7 8 9 10 11 12 13 14...

correct output
166651667000000

user output
166651667000000

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
166656666849999

user output
166656666849999

Test 14

Group: 3

Verdict: ACCEPTED

input
100000
2 3 1 5 6 4 8 9 7 11 12 10 14 ...

correct output
166651666966668

user output
166651666966668

Test 15

Group: 3

Verdict: ACCEPTED

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667250100