CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:thuustalu
Submission time:2017-01-21 02:44:41 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#20.04 s1details
#30.05 s1details
#40.04 s1details
#50.04 s1details
#60.04 s2details
#70.04 s2details
#80.04 s2details
#90.04 s2details
#100.04 s2details
#110.20 s3details
#120.12 s3details
#130.07 s3details
#140.07 s3details
#150.05 s3details

Code

#include <iostream>
#include <stdlib.h>

const int MAX_ROOM = 100005;

using namespace std;

int depc [MAX_ROOM], arrc [MAX_ROOM], root [MAX_ROOM], ans [MAX_ROOM];

int find (int u) {
  if (root[u] == u) {
    return u;
  } else {
    root[u] = find(root[u]);
    return root[u];
  }
}

void merge (int u, int v) {
  if (find(u) != find(v)) {
    if (rand() % 2 == 0) {
      root[find(u)] = find(v);
    } else {
      root[find(v)] = find(u);
    }
  }
}

int main () {
  for (int i = 0; i < MAX_ROOM; i++) {
    root[i] = i;
  }
  
  int roomc, edgec;
  cin >> roomc >> edgec;

  for (int i = 0; i < edgec; i++) {
    int u, v;
    cin >> u >> v;
  
    depc[u]++;
    arrc[v]++;

    merge(u, v);
  }

  for (int i = 1; i <= roomc; i++) {
    if (depc[i] > arrc[i]) {
      ans[find(i)] += depc[i] - arrc[i];
    }
  }

  int sol = 0;
  for (int i = 1; i <= roomc; i++) {
    if (root[i] == i) {
      sol += max(ans[i], 1);
    }
  }

  cout << sol << endl;
}

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:

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

correct output
5

user output
6

Test 3

Group: 1

Verdict:

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

correct output
4

user output
9

Test 4

Group: 1

Verdict:

input
10 4
9 1
6 8
7 1
5 7

correct output
3

user output
7

Test 5

Group: 1

Verdict:

input
10 2
10 6
2 1

correct output
2

user output
8

Test 6

Group: 2

Verdict:

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

correct output
97

user output
102

Test 7

Group: 2

Verdict:

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

correct output
60

user output
73

Test 8

Group: 2

Verdict:

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

correct output
34

user output
76

Test 9

Group: 2

Verdict:

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

correct output
29

user output
79

Test 10

Group: 2

Verdict:

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

correct output
18

user output
81

Test 11

Group: 3

Verdict:

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

correct output
102510

user output
107130

Test 12

Group: 3

Verdict:

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

correct output
60593

user output
79082

Test 13

Group: 3

Verdict:

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

correct output
35933

user output
76382

Test 14

Group: 3

Verdict:

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

correct output
30074

user output
77922

Test 15

Group: 3

Verdict:

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

correct output
16882

user output
85037