CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:ulna
Submission time:2017-01-21 12:05:46 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.07 s1details
#2ACCEPTED0.04 s1details
#30.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.03 s1details
#60.04 s2details
#7ACCEPTED0.04 s2details
#80.09 s2details
#9ACCEPTED0.04 s2details
#10ACCEPTED0.04 s2details
#110.07 s3details
#12ACCEPTED0.08 s3details
#13--3details
#14ACCEPTED0.07 s3details
#150.09 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:11:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
input/code.cpp:14:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^

Code

#include <bits/stdc++.h>
using namespace std;

// why am I so weak

int n;
int a[100055];
vector<int> g[100055];

int main() {
	scanf("%d", &n);

	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		a[i]--;

		g[a[i]].push_back(i);
	}

	long long res = 1ll * n * (n - 1) * (n - 2) / 6ll;

	for (int i = 0; i < n; i++) {
		if (a[a[i]] == i) {
			if (i > a[i]) continue;

			res -= 1ll * (n - 2 - (int)(g[a[i]].size() + g[i].size()));
			continue;
		}

		if (a[a[a[i]]] == i) {
			res -= 1ll * (n - 2 - (int)g[i].size());
		} else res -= 1ll * (n - 2 - (int)g[i].size() - 1);

		for (auto u : g[a[i]]) {
			if (u < i) {
				res++;
			}
		}
	}

	for (int i = 0; i < n; i++) {
		if (a[a[i]] == i) continue;

		if (a[a[a[i]]] == i) {
			if (min(min(i, a[i]), a[a[i]]) == i) {
				res--;
			} 

			continue;
		}

		res--;
	}

	printf("%lld\n", max(0ll, res));

	return 0;
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
156800

user output
156900

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:

input
100
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
156849

user output
156949

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:

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

correct output
20808340000

user output
20808345000

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:

input
5000
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
20808342499

user output
20808347499

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:

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

correct output
166656666800000

user output
166656666900000

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:

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

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667250107