Submission #33918

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
33918	2017-11-05T03:10:34 Z	imeimi2000	Toy Train (IOI17_train)	C++14	37 / 100	2000 ms	3080 KB

train

#include "train.h"

using namespace std;

int n, m;
vector<int> edge[5000];
vector<int> redge[5000];
int outdegree[5000];
int stop[5000];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n = a.size();
	m = u.size();
	for (int i = 0; i < m; ++i) {
		edge[u[i]].push_back(v[i]);
		redge[v[i]].push_back(u[i]);
	}
	for (int t = 0; t < n; ++t) {
		vector<int> st;
		for (int i = 0; i < n; ++i) {
			stop[i] = r[i] ^ 1;
			outdegree[i] = edge[i].size();
			if (r[i]) st.push_back(i);
		}
		while (!st.empty()) {
			int x = st.back();
			st.pop_back();

			for (int i : redge[x]) {
				if (stop[i] == 0) continue;
				--outdegree[i];
				if (a[i] == 1 || outdegree[i] == 0) {
					stop[i] = 0;
					st.push_back(i);
				}
			}
		}
		for (int i = 0; i < n; ++i) {
			if (stop[i] == 1) st.push_back(i);
			outdegree[i] = edge[i].size();
		}
		while (!st.empty()) {
			int x = st.back();
			st.pop_back();

			for (int i : redge[x]) {
				if (stop[i] == 1) continue;
				--outdegree[i];
				if (a[i] == 0 || outdegree[i] == 0) {
					stop[i] = 1;
					st.push_back(i);
				}
			}
		}
		for (int i = 0; i < n; ++i) {
			if (stop[i]) r[i] = 0;
		}
	}
	vector<int> ret;
	ret.resize(n);
	for (int i = 0; i < n; ++i) {
		ret[i] = stop[i] ^ 1;
	}
	return ret;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	796 ms	2740 KB	Output is correct
2	Correct	839 ms	2740 KB	Output is correct
3	Correct	839 ms	2740 KB	Output is correct
4	Correct	819 ms	2740 KB	Output is correct
5	Correct	836 ms	2740 KB	Output is correct
6	Correct	863 ms	2740 KB	Output is correct
7	Correct	536 ms	2740 KB	Output is correct
8	Correct	926 ms	2740 KB	Output is correct
9	Correct	916 ms	2740 KB	Output is correct
10	Correct	966 ms	2740 KB	Output is correct
11	Correct	773 ms	2736 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	2204 KB	Output is correct
2	Correct	2204 KB	Output is correct
3	Correct	2204 KB	Output is correct
4	Correct	2204 KB	Output is correct
5	Correct	2204 KB	Output is correct
6	Correct	2204 KB	Output is correct
7	Correct	2204 KB	Output is correct
8	Correct	2204 KB	Output is correct
9	Correct	2204 KB	Output is correct
10	Correct	2204 KB	Output is correct
11	Correct	2204 KB	Output is correct
12	Correct	2204 KB	Output is correct
13	Correct	2204 KB	Output is correct
14	Correct	2204 KB	Output is correct
15	Correct	2204 KB	Output is correct
16	Correct	2204 KB	Output is correct
17	Correct	2204 KB	Output is correct
18	Correct	2204 KB	Output is correct
19	Correct	2204 KB	Output is correct
20	Correct	2204 KB	Output is correct

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	586 ms	3080 KB	Output is correct
2	Correct	636 ms	3080 KB	Output is correct
3	Correct	649 ms	3080 KB	Output is correct
4	Correct	1353 ms	3080 KB	Output is correct
5	Correct	1776 ms	3080 KB	Output is correct
6	Correct	676 ms	3080 KB	Output is correct
7	Correct	1283 ms	3080 KB	Output is correct
8	Correct	1783 ms	3080 KB	Output is correct
9	Correct	763 ms	3060 KB	Output is correct
10	Correct	1776 ms	3068 KB	Output is correct
11	Correct	1923 ms	3068 KB	Output is correct
12	Correct	706 ms	3068 KB	Output is correct
13	Correct	1469 ms	3080 KB	Output is correct
14	Correct	1406 ms	3080 KB	Output is correct
15	Correct	1456 ms	3080 KB	Output is correct
16	Correct	1443 ms	3080 KB	Output is correct
17	Correct	1333 ms	3080 KB	Output is correct
18	Correct	599 ms	2892 KB	Output is correct

Subtask #4
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	833 ms	2960 KB	Output is correct
2	Correct	1689 ms	2916 KB	Output is correct
3	Correct	789 ms	3080 KB	Output is correct
4	Correct	753 ms	3080 KB	Output is correct
5	Correct	1513 ms	3080 KB	Output is correct
6	Correct	1846 ms	3072 KB	Output is correct
7	Correct	1833 ms	3072 KB	Output is correct
8	Correct	759 ms	3072 KB	Output is correct
9	Correct	1453 ms	3072 KB	Output is correct
10	Correct	1513 ms	3080 KB	Output is correct
11	Correct	943 ms	3080 KB	Output is correct
12	Correct	1583 ms	3080 KB	Output is correct
13	Correct	1549 ms	3080 KB	Output is correct
14	Correct	1586 ms	2924 KB	Output is correct

Subtask #5
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1943 ms	3080 KB	Output is correct
2	Correct	1843 ms	3080 KB	Output is correct
3	Execution timed out	2000 ms	3080 KB	Execution timed out
4	Halted	0 ms	0 KB	-

Subtask #6
0 / 51.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	796 ms	2740 KB	Output is correct
2	Correct	839 ms	2740 KB	Output is correct
3	Correct	839 ms	2740 KB	Output is correct
4	Correct	819 ms	2740 KB	Output is correct
5	Correct	836 ms	2740 KB	Output is correct
6	Correct	863 ms	2740 KB	Output is correct
7	Correct	536 ms	2740 KB	Output is correct
8	Correct	926 ms	2740 KB	Output is correct
9	Correct	916 ms	2740 KB	Output is correct
10	Correct	966 ms	2740 KB	Output is correct
11	Correct	773 ms	2736 KB	Output is correct
12	Correct	0 ms	2204 KB	Output is correct
13	Correct	0 ms	2204 KB	Output is correct
14	Correct	0 ms	2204 KB	Output is correct
15	Correct	0 ms	2204 KB	Output is correct
16	Correct	0 ms	2204 KB	Output is correct
17	Correct	0 ms	2204 KB	Output is correct
18	Correct	0 ms	2204 KB	Output is correct
19	Correct	0 ms	2204 KB	Output is correct
20	Correct	0 ms	2204 KB	Output is correct
21	Correct	0 ms	2204 KB	Output is correct
22	Correct	0 ms	2204 KB	Output is correct
23	Correct	0 ms	2204 KB	Output is correct
24	Correct	0 ms	2204 KB	Output is correct
25	Correct	0 ms	2204 KB	Output is correct
26	Correct	0 ms	2204 KB	Output is correct
27	Correct	0 ms	2204 KB	Output is correct
28	Correct	0 ms	2204 KB	Output is correct
29	Correct	0 ms	2204 KB	Output is correct
30	Correct	0 ms	2204 KB	Output is correct
31	Correct	0 ms	2204 KB	Output is correct
32	Correct	586 ms	3080 KB	Output is correct
33	Correct	636 ms	3080 KB	Output is correct
34	Correct	649 ms	3080 KB	Output is correct
35	Correct	1353 ms	3080 KB	Output is correct
36	Correct	1776 ms	3080 KB	Output is correct
37	Correct	676 ms	3080 KB	Output is correct
38	Correct	1283 ms	3080 KB	Output is correct
39	Correct	1783 ms	3080 KB	Output is correct
40	Correct	763 ms	3060 KB	Output is correct
41	Correct	1776 ms	3068 KB	Output is correct
42	Correct	1923 ms	3068 KB	Output is correct
43	Correct	706 ms	3068 KB	Output is correct
44	Correct	1469 ms	3080 KB	Output is correct
45	Correct	1406 ms	3080 KB	Output is correct
46	Correct	1456 ms	3080 KB	Output is correct
47	Correct	1443 ms	3080 KB	Output is correct
48	Correct	1333 ms	3080 KB	Output is correct
49	Correct	599 ms	2892 KB	Output is correct
50	Correct	833 ms	2960 KB	Output is correct
51	Correct	1689 ms	2916 KB	Output is correct
52	Correct	789 ms	3080 KB	Output is correct
53	Correct	753 ms	3080 KB	Output is correct
54	Correct	1513 ms	3080 KB	Output is correct
55	Correct	1846 ms	3072 KB	Output is correct
56	Correct	1833 ms	3072 KB	Output is correct
57	Correct	759 ms	3072 KB	Output is correct
58	Correct	1453 ms	3072 KB	Output is correct
59	Correct	1513 ms	3080 KB	Output is correct
60	Correct	943 ms	3080 KB	Output is correct
61	Correct	1583 ms	3080 KB	Output is correct
62	Correct	1549 ms	3080 KB	Output is correct
63	Correct	1586 ms	2924 KB	Output is correct
64	Correct	1943 ms	3080 KB	Output is correct
65	Correct	1843 ms	3080 KB	Output is correct
66	Execution timed out	2000 ms	3080 KB	Execution timed out
67	Halted	0 ms	0 KB	-

Submission #33918

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 11.0 / 11.0

Subtask #4 11.0 / 11.0

Subtask #5 0 / 12.0

Subtask #6 0 / 51.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
11.0 / 11.0

Subtask #4
11.0 / 11.0

Subtask #5
0 / 12.0

Subtask #6
0 / 51.0