CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:ruhanhabib39
Submission time:2017-01-20 19:08:31 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED16
#2ACCEPTED31
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.13 s1details
#2ACCEPTED0.09 s1details
#3ACCEPTED0.12 s1details
#4ACCEPTED0.12 s1details
#5ACCEPTED0.12 s1details
#6ACCEPTED0.09 s2details
#7ACCEPTED0.12 s2details
#8ACCEPTED0.10 s2details
#9ACCEPTED0.10 s2details
#10ACCEPTED0.10 s2details
#11ACCEPTED0.21 s3details
#12ACCEPTED0.21 s3details
#13ACCEPTED0.13 s3details
#14ACCEPTED0.13 s3details
#15ACCEPTED0.10 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:48:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &N, &M);
                         ^
input/code.cpp:50:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       int u, v; scanf("%d%d", &u, &v);
                                      ^

Code

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
int N, M;
deque<int> G[MAXN + 10];
vector<int> in[MAXN + 10];
int out[MAXN + 10];
int pos[MAXN + 10];
int ind[MAXN + 10];
bool vis[MAXN + 10];
void top_sort() {
queue<int> q;
int ii = N;
for(int u = 1; u <= N; u++) {
if(out[u] == 0) {
q.push(u);
}
}
while(!q.empty()) {
int v = q.front(); q.pop();
ind[ii] = v; pos[v] = ii;
--ii;
for(int u : in[v]) {
out[u]--;
if(out[u] == 0) q.push(u);
}
}
for(int u = 1; u <= N; u++) {
out[u] = G[u].size();
sort(G[u].begin(), G[u].end(),
[&](int u, int v) { return pos[u] < pos[v]; });
}
}
bool work(int u) {
if(G[u].size() == 0) return false;
work(G[u][0]);
G[u].pop_front();
return true;
}
int main() {
scanf("%d%d", &N, &M);
for(int i = 0; i < M; i++) {
int u, v; scanf("%d%d", &u, &v);
out[u]++;
G[u].push_back(v);
in[v].push_back(u);
}
top_sort();
int res = 0;
for(int i = 1; i <= N; i++) {
while(work(ind[i])) {
res++;
}
}
printf("%d\n", res);
}

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