CSES - DatatÃ¤hti Open 2017 - Results
 Task: Tunnels Sender: fjuengermann Submission time: 2017-01-22 13:08:27 +0200 Language: Java Status: READY Result: 0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.17 s1details
#20.15 s1details
#30.16 s1details
#40.15 s1details
#50.15 s1details
#60.15 s2details
#70.15 s2details
#80.15 s2details
#90.15 s2details
#100.17 s2details
#11--3details
#120.83 s3details
#130.54 s3details
#140.54 s3details
#150.41 s3details

### Code

```import java.util.ArrayList;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
* Created by Florian on 22-Jan-17.
*/
public class Tunnels {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
StringTokenizer st = new StringTokenizer(sc.nextLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
int[] inoutDif = new int[n];//-in+out
ArrayList<ArrayList<Integer>> connections = new ArrayList<>();
for (int i = 0; i < n; i++) {
}
for (int i = 0; i < m; i++) {
st = new StringTokenizer(sc.nextLine());
int a = Integer.parseInt(st.nextToken()) - 1;
int b = Integer.parseInt(st.nextToken()) - 1;
inoutDif[a]++;
inoutDif[b]--;
}
//is connected?
boolean[] visited = new boolean[n];
int count = 0;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
int daysUsed = DFS(visited, connections, i, inoutDif);
daysUsed = Math.max(1, daysUsed);
count += daysUsed;
}
}
System.out.println(count);

}

private static int DFS(boolean[] visited, ArrayList<ArrayList<Integer>> connections, int i, int[] inoutDif) {
visited[i] = true;
int daysCount = Math.max(0, inoutDif[i]);
for (Integer room : connections.get(i)) {
if (!visited[room])
daysCount += DFS(visited, connections, room, inoutDif);
}
return daysCount;
}
}
```

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

Group: 1

Verdict:

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

correct output
5

user output
6

Group: 1

Verdict:

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

correct output
4

user output
9

Group: 1

Verdict:

input
10 4
9 1
6 8
7 1
5 7

correct output
3

user output
7

Group: 1

Verdict:

input
10 2
10 6
2 1

correct output
2

user output
8

Group: 2

Verdict:

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

correct output
97

user output
102

Group: 2

Verdict:

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

correct output
60

user output
73

Group: 2

Verdict:

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

correct output
34

user output
76

Group: 2

Verdict:

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

correct output
29

user output
79

Group: 2

Verdict:

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

correct output
18

user output
81

Group: 3

Verdict:

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

correct output
102510

user output
(empty)

Group: 3

Verdict:

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

correct output
60593

user output
79082

Group: 3

Verdict:

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

correct output
35933

user output
76382

Group: 3

Verdict:

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

correct output
30074

user output
77922

Group: 3

Verdict:

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

correct output
16882

user output
85037