Code Submission Evaluation System Login

Datatähti 2017 loppu

Start:2017-01-19 12:15:00
End:2017-01-19 17:15:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2017 loppu - Results
History
2017-01-19 12:50:26100
2017-01-19 12:36:060
2017-01-19 12:33:070
2017-01-19 12:30:230
Task:Tunnelit
Sender:Kuha
Submission time:2017-01-19 12:50:26
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED16
#2ACCEPTED31
#3ACCEPTED53

Test results

testverdicttime (s)group
#1ACCEPTED0.03 / 1.001details
#2ACCEPTED0.04 / 1.001details
#3ACCEPTED0.04 / 1.001details
#4ACCEPTED0.04 / 1.001details
#5ACCEPTED0.04 / 1.001details
#6ACCEPTED0.06 / 1.002details
#7ACCEPTED0.02 / 1.002details
#8ACCEPTED0.04 / 1.002details
#9ACCEPTED0.05 / 1.002details
#10ACCEPTED0.05 / 1.002details
#11ACCEPTED0.23 / 1.003details
#12ACCEPTED0.16 / 1.003details
#13ACCEPTED0.10 / 1.003details
#14ACCEPTED0.06 / 1.003details
#15ACCEPTED0.06 / 1.003details

Code

#include <bits/stdc++.h>

#define ll long long

using namespace std;

vector<int> v[111111];
int out[111111];
int in[111111];
queue<int> q;

void dfs (int i) {
	if (v[i].empty()) return;
	int j = v[i].back();
	v[i].pop_back();
	in[j]--;
	out[i]--;
	if (!in[j]) q.push(j);
	dfs(j);
}

int main () {
	int n, m;
	cin>>n>>m;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin>>a>>b;
		v[a].push_back(b);
		in[b]++;
		out[a]++;
	}
	int ans = 0;
	
	for (int i = 1; i <= n; i++) if (!in[i]) q.push(i);
	while (!q.empty()) {
		int x = q.front();
		q.pop();
		while (out[x]) {
			dfs(x);
			ans++;
		}
	}
	cout<<ans<<endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
11

view   save

user output
11

view   save

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
5

view   save

user output
5

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
10 5
5 7
3 8
5 8
3 7
...
view   save

correct output
4

view   save

user output
4

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
10 4
9 1
6 8
7 1
5 7
view   save

correct output
3

view   save

user output
3

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
10 2
10 6
2 1

view   save

correct output
2

view   save

user output
2

view   save

Test 6

Group: 2

Verdict: ACCEPTED

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

correct output
97

view   save

user output
97

view   save

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
60

view   save

user output
60

view   save

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
34

view   save

user output
34

view   save

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
29

view   save

user output
29

view   save

Test 10

Group: 2

Verdict: ACCEPTED

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

correct output
18

view   save

user output
18

view   save

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
102510

view   save

user output
102510

view   save

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
60593

view   save

user output
60593

view   save

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
35933

view   save

user output
35933

view   save

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
30074

view   save

user output
30074

view   save

Test 15

Group: 3

Verdict: ACCEPTED

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

correct output
16882

view   save

user output
16882

view   save