CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Witch game
Sender:	Xellos
Submission time:	2017-01-19 23:06:57 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	ACCEPTED	24
#3	ACCEPTED	53

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.03 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.03 s	1	details
#6	ACCEPTED	0.03 s	2	details
#7	ACCEPTED	0.04 s	2	details
#8	ACCEPTED	0.04 s	2	details
#9	ACCEPTED	0.05 s	2	details
#10	ACCEPTED	0.04 s	2	details
#11	ACCEPTED	0.06 s	3	details
#12	ACCEPTED	0.06 s	3	details
#13	ACCEPTED	0.07 s	3	details
#14	ACCEPTED	0.05 s	3	details
#15	ACCEPTED	0.05 s	3	details

Code

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
 
#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif
 
/*
	Spurdo Spärde :DDDD
	SPEDE BEARD
	PEDRO SPORA
	PURJO PORE
	SPEARMINT PUDDING
	SPORO LORO
	PUDRO BARDE
	BENIS XDDDD :DDD XD
*/
 
int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
 
	int N;
	cin >> N;
	vector<int> dg(N,0), nxt(N);
	for(int i =0; i < N; i++) {
		cin >> nxt[i];
		nxt[i]--;
		dg[i]++;
		dg[nxt[i]]++;}
 
	long long A =1LL*N*(N-1)*(N-2)/6, B =1LL*N*(N-2);
	for(int i =0; i < N; i++) if(nxt[i] < i && nxt[nxt[i]] == i) B -=(N-2);
 
	long long C =0;
	for(int i =0; i < N; i++) C +=1LL*dg[i]*(dg[i]-1)/2;
	for(int i =0; i < N; i++) if(nxt[i] != i && nxt[nxt[i]] == i) C -=dg[i]-1;
 
	long long D =0;
	for(int i =0; i < N; i++) if(nxt[i] != i && nxt[nxt[i]] != i)
		if(nxt[nxt[nxt[i]]] == i) D++;
	D /=3;
 
//	cout << A << " " << B << " " << C << " " << D << "\n";
	cout << A-D+C-B << "\n";
	return 0;}
 
// look at my code
// my code is amazing

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`100 2 1 4 3 6 5 8 7 10 9 12 11 14 ...` view save

correct output
`156800` view save

user output
`156800` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`100 2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

correct output
`152000` view save

user output
`152000` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`100 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`156849` view save

user output
`156849` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`100 2 3 1 5 6 4 8 9 7 11 12 10 14 ...` view save

correct output
`151968` view save

user output
`151968` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`100 8 98 100 62 42 36 95 70 22 49 ...` view save

correct output
`152040` view save

user output
`152040` view save

Test 6

Group: 2

Verdict: ACCEPTED

input
`5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ...` view save

correct output
`20808340000` view save

user output
`20808340000` view save

Test 7

Group: 2

Verdict: ACCEPTED

input
`5000 2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

correct output
`20795850000` view save

user output
`20795850000` view save

Test 8

Group: 2

Verdict: ACCEPTED

input
`5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`20808342499` view save

user output
`20808342499` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`5000 2 3 1 5 6 4 8 9 7 11 12 10 14 ...` view save

correct output
`20795848337` view save

user output
`20795848337` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`5000 283 2880 2565 3289 4160 936 39...` view save

correct output
`20795852465` view save

user output
`20795852465` view save

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
`166656666800000` view save

user output
`166656666800000` view save

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
`166651667000000` view save

user output
`166651667000000` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`100000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`166656666849999` view save

user output
`166656666849999` view save

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
`166651666966668` view save

user output
`166651666966668` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`100000 186 62491 95379 37431 88427 93...` view save

correct output
`166651667250100` view save

user output
`166651667250100` view save

Datatähti Open 2017

Witch game

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (Xellos)