CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:Wrinx
Submission time:2017-01-21 20:39:04 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1details
#20.06 s1details
#30.05 s1details
#40.04 s1details
#50.05 s1details
#60.04 s2details
#70.05 s2details
#80.04 s2details
#90.05 s2details
#100.04 s2details
#110.15 s3details
#120.12 s3details
#130.10 s3details
#140.07 s3details
#150.07 s3details

Compiler report

input/code.cpp: In function 'void dfs(int)':
input/code.cpp:16:9: warning: unused variable 't' [-Wunused-variable]
     int t = 0;
         ^

Code

#include<bits/stdc++.h>

#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
vector < int > g[200000];
int ans, b[200000], used[200000];
set < int > s;
vector < int > k;
void dfs(int v)
{
    used[v] = 1;
    int t = 0;
    for (auto u: g[v])
    if (!used[u]){
        dfs(u);
        break;
    }
    for (auto u: g[v]){
        b[u]--;
        if (b[u] == 0) s.insert(u);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        b[v]++;
    }
    for (int i = 1; i <= n; i++) if (b[i] == 0) k.pb(i);
    for (int i = 1; i <= n; i++){
        for (auto u: k)
        if (!used[u]){
            ans++;
            dfs(u);
        }
        k.clear();
        for (int i: s)
            k.pb(i);
        s.clear();
    }
    cout << ans;
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
11

user output
4

Test 2

Group: 1

Verdict:

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

correct output
5

user output
4

Test 3

Group: 1

Verdict:

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

correct output
4

user output
7

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
40

Test 7

Group: 2

Verdict:

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

correct output
60

user output
56

Test 8

Group: 2

Verdict:

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

correct output
34

user output
70

Test 9

Group: 2

Verdict:

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

correct output
29

user output
74

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
44469

Test 12

Group: 3

Verdict:

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

correct output
60593

user output
57217

Test 13

Group: 3

Verdict:

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

correct output
35933

user output
70558

Test 14

Group: 3

Verdict:

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

correct output
30074

user output
74382

Test 15

Group: 3

Verdict:

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

correct output
16882

user output
84348