| Task: | Tunnels |
| Sender: | Sanja |
| Submission time: | 2017-07-21 15:29:49 +0300 |
| Language: | Pascal |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 16 |
| #2 | ACCEPTED | 31 |
| #3 | ACCEPTED | 53 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.04 s | 1 | details |
| #3 | ACCEPTED | 0.05 s | 1 | details |
| #4 | ACCEPTED | 0.05 s | 1 | details |
| #5 | ACCEPTED | 0.03 s | 1 | details |
| #6 | ACCEPTED | 0.04 s | 2 | details |
| #7 | ACCEPTED | 0.04 s | 2 | details |
| #8 | ACCEPTED | 0.04 s | 2 | details |
| #9 | ACCEPTED | 0.03 s | 2 | details |
| #10 | ACCEPTED | 0.03 s | 2 | details |
| #11 | ACCEPTED | 0.10 s | 3 | details |
| #12 | ACCEPTED | 0.09 s | 3 | details |
| #13 | ACCEPTED | 0.06 s | 3 | details |
| #14 | ACCEPTED | 0.05 s | 3 | details |
| #15 | ACCEPTED | 0.06 s | 3 | details |
Compiler report
/usr/bin/ld.bfd: warning: output/link.res contains output sections; did you forget -T?
Code
const MAX_N = 100000 + 123;
type tEdge = record
next , dest : LongInt;
end;
var E : array [ 1 .. MAX_N * 2 ] of tEdge;
ee : LongInt = 0;
Link : array [ 1 .. MAX_N ] of LongInt;
var InPower , OutPower : 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;
inc ( OutPower[u] );
inc ( InPower[v] );
end;
var N , M : LongInt;
var Q : array [ 1 .. MAX_N ] of LongInt;
qq : LongInt;
procedure Push ( v : LongInt ) ;
begin
inc ( qq ) ;
Q[qq] := v;
end;
procedure DFS ( v, p: LongInt ) ;
var tmp : LongInt;
begin
//write ( v , ' ' );
if ( OutPower[v] = 0 ) then exit();
if ( p <> -1 ) then
begin
dec ( InPower[v] );
if ( InPower[v] = 0 ) then
Push ( v );
end;
tmp := Link[v];
DFS ( E[tmp].dest , v );
dec ( OutPower[v] );
Link[v] := E [ Link[v] ].next;
end;
var i : LongInt;
a , b , ans : LongInt;
begin
readLn ( N , M ) ;
for i := 1 to M do
begin
readLn ( a , b ) ;
addEdge ( a , b );
end;
for i := 1 to N do
begin
if ( InPower[i] = 0 ) then
Push ( i );
end;
ans := 0;
i := 1;
while ( i <= qq ) do
begin
while ( OutPower[ Q[i] ] > 0 ) do
begin
DFS ( Q[i] , -1 );
//writeLn();
inc ( ans );
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 |