CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:Sanja
Submission time:2017-01-22 13:15:02 +0200
Language:Pascal
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#2ACCEPTED0.04 s1details
#30.04 s1details
#40.04 s1details
#50.04 s1details
#60.03 s2details
#7ACCEPTED0.04 s2details
#80.05 s2details
#90.03 s2details
#10ACCEPTED0.05 s2details
#110.06 s3details
#12ACCEPTED0.07 s3details
#130.08 s3details
#140.06 s3details
#150.05 s3details

Compiler report

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

Code

Const MAX_N = 100000;
Type tEdge = record
dest , next : LongInt;
end;
var E : array [ 1 .. MAX_N ] of tEdge;
ee : LongInt;
Link : array [ 1 .. MAX_N ] of LongInt;
procedure addEdge ( u , v : LongInt ) ;
begin
inc ( ee ) ;
E[ee].dest := v;
E[ee].next := Link[u];
Link[u] := ee;
end;
var N : LongInt;
A , Cnt : Array [ 1 .. 100000 ] of LongInt;
Cycle : LongInt;
Ans : Int64;
var i : LongInt;
cCycle : LongInt;
cEdge : LongInt;
cVertex : LongINt;
cAns : Int64;
tmp : LongInt;
begin
readLn ( N ) ;
for i := 1 to N do
read ( A[i] );
Cycle := 0 ;
for i := 1 to N do
if ( i = A[ A[i] ] ) then
inc ( Cycle );
for i := 1 to N do
begin
inc ( Cnt[ A[i] ] );
addEdge ( A[i] , i );
end;
Ans := 0 ;
for i := 1 to N do
begin
cEdge := ee - 1 ; // I -> x
cVertex := N-1; // I
if ( i = A[ A[i] ] ) then
begin
cCycle := Cycle - 1;
end
else
begin
dec ( cVertex ) ; // I --> x
dec ( cEdge , Cnt [ A[i] ] );
end;
tmp := Link[i];
while ( tmp > 0 ) do
begin
dec ( cVertex ) ; // E[tmp].dest
dec ( cEdge ) ; // E[tmp].dest -> I
dec ( cEdge , Cnt [ E[tmp].dest ] ); // xxxx -> E[tmp].dest
tmp := E[tmp].next;
end;
cAns := ( Int64(cVertex)*(cVertex-1) div 2 ) - cEdge + cCycle;
Ans += cAns;
end;
writeLn ( Ans div 3 ) ;
end.

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
158500

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
156883

Test 4

Group: 1

Verdict:

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

correct output
151968

user output
152001

Test 5

Group: 1

Verdict:

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

correct output
152040

user output
152041

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
20812508333

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
20808344166

Test 9

Group: 2

Verdict:

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

correct output
20795848337

user output
20795850003

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
166658333500000

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
166656666883333

Test 14

Group: 3

Verdict:

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

correct output
166651666966668

user output
166651667000001

Test 15

Group: 3

Verdict:

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667248450