CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:Sanja
Submission time:2017-01-22 11:54:38 +0200
Language:Pascal
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED16
#2ACCEPTED31
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.03 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.04 s2details
#9ACCEPTED0.04 s2details
#10ACCEPTED0.04 s2details
#11ACCEPTED0.10 s3details
#12ACCEPTED0.09 s3details
#13ACCEPTED0.06 s3details
#14ACCEPTED0.06 s3details
#15ACCEPTED0.04 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 .. 2*MAX_N ] of tEdge;
ee : LongInt;
Link_In , Link_Out : array [ 1 .. MAX_N ] of LongInt;
procedure addEdge ( u , v : LongInt ) ;
begin
Link_Out[u] += 1;
// u <- v back edge
inc ( ee ) ;
E[ee].dest := u;
E[ee].next := Link_In[v];
Link_In[v] := ee;
end;
var Q : array [ 1 .. MAX_N ] of LongInt;
qq : LongInt = 0 ;
procedure Push ( x : LongInt ) ;
begin
inc ( qq ) ;
Q[qq] := x;
end;
procedure DFS ( v : LongInt ) ;
var tmp : tEdge;
begin
if ( Link_In[v] = 0 ) then
exit();
tmp := E[ Link_In[v] ];
//writeLn ( v , ' -> ' , tmp.dest );
DFS ( tmp.dest );
dec ( Link_Out [ tmp.dest ] );
if ( Link_Out[tmp.dest] = 0 ) and ( Link_In[tmp.dest] > 0 ) then
Push ( tmp.dest );
Link_In[v] := tmp.next;
end;
var N , M : LongInt;
u , v , i , ans : LongInt;
begin
ans := 0 ;
readLn ( N , M ) ;
for i := 1 to M do
begin
readLn ( U , V ) ;
addEdge ( u , v ) ;
end;
for i := 1 to N do
if ( Link_Out[i] = 0 ) and ( Link_In[i] > 0 ) then
Push ( i ) ;
i := 1;
while ( i <= qq ) do
begin
while ( Link_In[ q[i] ] > 0 ) do
begin
DFS ( q[i] );
inc ( ans ) ;
//writeLn ( 'END ' ) ;
end;
inc ( i ) ;
end;
writeLn ( ans ) ;
end.

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 20
4 5
6 4
5 1
5 9
...

correct output
11

user output
11

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10
7 3
5 2
9 7
1 5
...

correct output
5

user output
5

Test 3

Group: 1

Verdict: ACCEPTED

input
10 5
5 7
3 8
5 8
3 7
...

correct output
4

user output
4

Test 4

Group: 1

Verdict: ACCEPTED

input
10 4
9 1
6 8
7 1
5 7

correct output
3

user output
3

Test 5

Group: 1

Verdict: ACCEPTED

input
10 2
10 6
2 1

correct output
2

user output
2

Test 6

Group: 2

Verdict: ACCEPTED

input
100 200
24 40
25 6
36 93
92 90
...

correct output
97

user output
97

Test 7

Group: 2

Verdict: ACCEPTED

input
100 100
98 37
91 37
60 92
46 27
...

correct output
60

user output
60

Test 8

Group: 2

Verdict: ACCEPTED

input
100 50
74 95
53 72
69 85
14 13
...

correct output
34

user output
34

Test 9

Group: 2

Verdict: ACCEPTED

input
100 40
28 76
10 81
13 52
46 83
...

correct output
29

user output
29

Test 10

Group: 2

Verdict: ACCEPTED

input
100 20
27 35
72 92
56 4
64 80
...

correct output
18

user output
18

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 200000
89244 59358
22943 56710
63331 89437
56581 38400
...

correct output
102510

user output
102510

Test 12

Group: 3

Verdict: ACCEPTED

input
100000 100000
21701 85599
61542 21474
38081 29362
46316 64038
...

correct output
60593

user output
60593

Test 13

Group: 3

Verdict: ACCEPTED

input
100000 50000
86469 4833
16351 35505
59315 33011
95464 16985
...

correct output
35933

user output
35933

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 40000
5392 23534
63204 45619
74330 25925
59678 88427
...

correct output
30074

user output
30074

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 20000
80156 16531
71753 77661
7028 33389
17168 646
...

correct output
16882

user output
16882