CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:Sanja
Submission time:2017-07-07 19:27:38 +0300
Language:Pascal
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED23
#2ACCEPTED24
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.03 s1details
#6ACCEPTED0.04 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.04 s2details
#9ACCEPTED0.04 s2details
#10ACCEPTED0.03 s2details
#11ACCEPTED0.06 s3details
#12ACCEPTED0.04 s3details
#13ACCEPTED0.06 s3details
#14ACCEPTED0.06 s3details
#15ACCEPTED0.06 s3details

Compiler report

/usr/bin/ld.bfd: warning: output/link.res contains output sections; did you forget -T?

Code

const MAX_N = 100000;
function Choose ( k , n : Int64 ) : Int64;
begin
Choose := ( n * ( n - 1 ) * ( n - 2 ) div ( 6 ) );
end;
var N : LongInt;
E : array [ 1 .. MAX_N ] of LongInt;
Light , Dark : array [ 1 .. MAX_N ] of LongInt;
function NOT_MONO() : Int64;
var i : LongInt;
res : Int64;
begin
res := 0;
for i := 1 to N do
begin
//writeLn ( Light[i] , ' ' , Dark[i] );
res += Int64(Light[i]) * Int64(Dark[i]);
end;
exit ( res div 2 );
end;
function Triangle ( ) : LongInt;
var v , a , b , c : LongInt;
res : LongInt;
begin
res := 0;
for v := 1 to N do
begin
a := v;
b := E[v];
c := E[b];
if ( a <> b ) and ( b <> c ) and ( E[c] = a ) then
inc ( res );
end;
exit ( res div 3 );
end;
procedure app ( v : LongInt );
begin
inc ( Light[v] );
dec ( Dark[v] );
end;
var i : LongInt;
Ans : Int64;
tmp : LongInt;
begin
readLn ( N );
for i := 1 to N do
Dark[i] := N-1;
for i := 1 to N do
Light[i] := 0;
for i := 1 to N do
begin
read ( E[i] );
end;
for i := 1 to N do
begin
tmp := E[i];
if ( E[tmp] = i ) then
begin
if ( tmp > i ) then
begin
app ( i );
app ( tmp );
end;
end
else
begin
app ( i );
app ( tmp );
end;
end;
Ans := Choose ( 3 , N ) - NOT_MONO() - TRIANGLE();
//writeLn ( Choose(3,N) , ' - ' , NOT_MONO() , ' - ' , TRIANGLE() );
writeLn ( Ans );
end.

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