oj.uz

Submission #53482

# Submission time Handle Problem Language Result Execution time Memory
53482 2018-06-30T05:46:36 Z jwvg0425 Toy Train (IOI17_train) C++17
100 / 100
 3739 ms 1904 KB 
#include "train.h"
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
 
int n, m, D[5010], U[5010], InQ[5010], C[5010];
vector<int>E[5010], F[5010];
 
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n = a.size();
	m = u.size();
	int i, j, k;
	for (i = 0; i < n; i++) {
		if (r[i] == 1)D[i] = 1;
		else D[i] = 0;
	}
	queue<int>Q;
	for (i = 0; i < m; i++) {
		E[u[i]].push_back(v[i]);
		F[v[i]].push_back(u[i]);
	}
	for (i = 0; i < n; i++) {
		if (a[i] == 1) {
			for (auto &t : E[i]) {
				if (D[i] < D[t] + r[i]) {
					Q.push(i);
					InQ[i] = 1;
					break;
				}
			}
		}
		if (a[i] == 0) {
			int ck = 0;
			for (auto &t : E[i]) {
				if (D[i] >= D[t] + r[i])C[i]++;
			}
			if (C[i] == 0) {
				Q.push(i);
				InQ[i] = 1;
			}
		}
	}
	int cc = 0;
	while (!Q.empty()) {
		int x = Q.front();
		Q.pop();
		InQ[x] = 0;
		if (a[x] == 1) {
			int d = -1e9;
			for (auto &t : E[x]) {
				d = max(d, D[t] + r[x]);
			}
			d = min(d, n);
			if (D[x] == d) {
				cc++;
				continue;
			}
			int od = D[x];
			D[x] = d;
			for (auto &t : F[x]) {
				if (a[t] == 1) {
					if (D[t] < r[t] + d) {
						if (!InQ[t]) {
							InQ[t] = 1;
							Q.push(t);
						}
					}
				}
				else {
					if (D[t] >= r[t] + od && D[t] < r[t] + d) {
						C[t]--;
						if (!C[t]) {
							if (!InQ[t]) {
								InQ[t] = 1;
								Q.push(t);
							}
						}
					}
				}
			}
		}
		else {
			int d = 1e9;
			for (auto &t : E[x]) {
				d = min(d, D[t] + r[x]);
			}
			d = min(d, n);
			if (D[x] == d) {
				cc++;
				continue;
			}
			C[x] = 0;
			for (auto &t : E[x]) {
				if (d >= D[t] + r[x])C[x]++;
			}
			int od = D[x];
			D[x] = d;
			for (auto &t : F[x]) {
				if (a[t] == 1) {
					if (D[t] < r[t] + d) {
						if (!InQ[t]) {
							InQ[t] = 1;
							Q.push(t);
						}
					}
				}
				else {
					int u = D[t];
					if (D[t] >= r[t] + od && D[t] < r[t] + d) {
						C[t]--;
						if (!C[t]) {
							if (!InQ[t]) {
								InQ[t] = 1;
								Q.push(t);
							}
						}
					}
				}
			}
			D[x] = d;
		}
	}
	vector<int>res(n);
	for (i = 0; i < n; i++) {
		if (D[i] >= n)res[i] = 1;
		else res[i] = 0;
	}
	return res;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:35:8: warning: unused variable 'ck' [-Wunused-variable]
    int ck = 0;
        ^~
train.cpp:110:10: warning: unused variable 'u' [-Wunused-variable]
      int u = D[t];
          ^
train.cpp:14:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j, k;
         ^
train.cpp:14:12: warning: unused variable 'k' [-Wunused-variable]
  int i, j, k;
            ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 1136 KB Output is correct
2 Correct 346 ms 1232 KB Output is correct
3 Correct 349 ms 1232 KB Output is correct
4 Correct 315 ms 1244 KB Output is correct
5 Correct 337 ms 1436 KB Output is correct
6 Correct 416 ms 1436 KB Output is correct
7 Correct 89 ms 1436 KB Output is correct
8 Correct 477 ms 1480 KB Output is correct
9 Correct 417 ms 1480 KB Output is correct
10 Correct 448 ms 1480 KB Output is correct
11 Correct 309 ms 1480 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 1852 KB Output is correct
2 Correct 194 ms 1852 KB Output is correct
3 Correct 194 ms 1852 KB Output is correct
4 Correct 1180 ms 1852 KB Output is correct
5 Correct 1363 ms 1852 KB Output is correct
6 Correct 43 ms 1852 KB Output is correct
7 Correct 515 ms 1852 KB Output is correct
8 Correct 895 ms 1852 KB Output is correct
9 Correct 22 ms 1852 KB Output is correct
10 Correct 1109 ms 1852 KB Output is correct
11 Correct 497 ms 1852 KB Output is correct
12 Correct 13 ms 1852 KB Output is correct
13 Correct 2444 ms 1852 KB Output is correct
14 Correct 2539 ms 1852 KB Output is correct
15 Correct 2451 ms 1852 KB Output is correct
16 Correct 2588 ms 1852 KB Output is correct
17 Correct 2697 ms 1852 KB Output is correct
18 Correct 131 ms 1852 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3279 ms 1852 KB Output is correct
2 Correct 1948 ms 1852 KB Output is correct
3 Correct 53 ms 1852 KB Output is correct
4 Correct 11 ms 1852 KB Output is correct
5 Correct 1310 ms 1852 KB Output is correct
6 Correct 2391 ms 1852 KB Output is correct
7 Correct 2113 ms 1852 KB Output is correct
8 Correct 26 ms 1852 KB Output is correct
9 Correct 2162 ms 1852 KB Output is correct
10 Correct 3694 ms 1852 KB Output is correct
11 Correct 3697 ms 1852 KB Output is correct
12 Correct 3739 ms 1852 KB Output is correct
13 Correct 1644 ms 1852 KB Output is correct
14 Correct 2226 ms 1852 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1776 ms 1852 KB Output is correct
2 Correct 2871 ms 1852 KB Output is correct
3 Correct 2705 ms 1856 KB Output is correct
4 Correct 3310 ms 1856 KB Output is correct
5 Correct 3 ms 1856 KB Output is correct
6 Correct 6 ms 1856 KB Output is correct
7 Correct 79 ms 1856 KB Output is correct
8 Correct 7 ms 1856 KB Output is correct
9 Correct 77 ms 1856 KB Output is correct
10 Correct 5 ms 1856 KB Output is correct
11 Correct 168 ms 1856 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 1136 KB Output is correct
2 Correct 346 ms 1232 KB Output is correct
3 Correct 349 ms 1232 KB Output is correct
4 Correct 315 ms 1244 KB Output is correct
5 Correct 337 ms 1436 KB Output is correct
6 Correct 416 ms 1436 KB Output is correct
7 Correct 89 ms 1436 KB Output is correct
8 Correct 477 ms 1480 KB Output is correct
9 Correct 417 ms 1480 KB Output is correct
10 Correct 448 ms 1480 KB Output is correct
11 Correct 309 ms 1480 KB Output is correct
12 Correct 2 ms 1480 KB Output is correct
13 Correct 2 ms 1480 KB Output is correct
14 Correct 2 ms 1480 KB Output is correct
15 Correct 2 ms 1480 KB Output is correct
16 Correct 2 ms 1480 KB Output is correct
17 Correct 2 ms 1480 KB Output is correct
18 Correct 2 ms 1480 KB Output is correct
19 Correct 2 ms 1480 KB Output is correct
20 Correct 2 ms 1480 KB Output is correct
21 Correct 2 ms 1480 KB Output is correct
22 Correct 2 ms 1480 KB Output is correct
23 Correct 2 ms 1480 KB Output is correct
24 Correct 2 ms 1480 KB Output is correct
25 Correct 3 ms 1480 KB Output is correct
26 Correct 2 ms 1480 KB Output is correct
27 Correct 2 ms 1480 KB Output is correct
28 Correct 2 ms 1480 KB Output is correct
29 Correct 3 ms 1480 KB Output is correct
30 Correct 2 ms 1480 KB Output is correct
31 Correct 2 ms 1480 KB Output is correct
32 Correct 84 ms 1852 KB Output is correct
33 Correct 194 ms 1852 KB Output is correct
34 Correct 194 ms 1852 KB Output is correct
35 Correct 1180 ms 1852 KB Output is correct
36 Correct 1363 ms 1852 KB Output is correct
37 Correct 43 ms 1852 KB Output is correct
38 Correct 515 ms 1852 KB Output is correct
39 Correct 895 ms 1852 KB Output is correct
40 Correct 22 ms 1852 KB Output is correct
41 Correct 1109 ms 1852 KB Output is correct
42 Correct 497 ms 1852 KB Output is correct
43 Correct 13 ms 1852 KB Output is correct
44 Correct 2444 ms 1852 KB Output is correct
45 Correct 2539 ms 1852 KB Output is correct
46 Correct 2451 ms 1852 KB Output is correct
47 Correct 2588 ms 1852 KB Output is correct
48 Correct 2697 ms 1852 KB Output is correct
49 Correct 131 ms 1852 KB Output is correct
50 Correct 3279 ms 1852 KB Output is correct
51 Correct 1948 ms 1852 KB Output is correct
52 Correct 53 ms 1852 KB Output is correct
53 Correct 11 ms 1852 KB Output is correct
54 Correct 1310 ms 1852 KB Output is correct
55 Correct 2391 ms 1852 KB Output is correct
56 Correct 2113 ms 1852 KB Output is correct
57 Correct 26 ms 1852 KB Output is correct
58 Correct 2162 ms 1852 KB Output is correct
59 Correct 3694 ms 1852 KB Output is correct
60 Correct 3697 ms 1852 KB Output is correct
61 Correct 3739 ms 1852 KB Output is correct
62 Correct 1644 ms 1852 KB Output is correct
63 Correct 2226 ms 1852 KB Output is correct
64 Correct 1776 ms 1852 KB Output is correct
65 Correct 2871 ms 1852 KB Output is correct
66 Correct 2705 ms 1856 KB Output is correct
67 Correct 3310 ms 1856 KB Output is correct
68 Correct 3 ms 1856 KB Output is correct
69 Correct 6 ms 1856 KB Output is correct
70 Correct 79 ms 1856 KB Output is correct
71 Correct 7 ms 1856 KB Output is correct
72 Correct 77 ms 1856 KB Output is correct
73 Correct 5 ms 1856 KB Output is correct
74 Correct 168 ms 1856 KB Output is correct
75 Correct 175 ms 1856 KB Output is correct
76 Correct 252 ms 1856 KB Output is correct
77 Correct 302 ms 1856 KB Output is correct
78 Correct 286 ms 1856 KB Output is correct
79 Correct 303 ms 1856 KB Output is correct
80 Correct 2327 ms 1856 KB Output is correct
81 Correct 589 ms 1856 KB Output is correct
82 Correct 1759 ms 1856 KB Output is correct
83 Correct 1809 ms 1876 KB Output is correct
84 Correct 1539 ms 1876 KB Output is correct
85 Correct 16 ms 1876 KB Output is correct
86 Correct 1030 ms 1904 KB Output is correct
87 Correct 12 ms 1904 KB Output is correct
88 Correct 234 ms 1904 KB Output is correct
89 Correct 1357 ms 1904 KB Output is correct
90 Correct 36 ms 1904 KB Output is correct
91 Correct 206 ms 1904 KB Output is correct
92 Correct 992 ms 1904 KB Output is correct
93 Correct 769 ms 1904 KB Output is correct
94 Correct 493 ms 1904 KB Output is correct
95 Correct 658 ms 1904 KB Output is correct
96 Correct 2165 ms 1904 KB Output is correct
97 Correct 368 ms 1904 KB Output is correct
98 Correct 795 ms 1904 KB Output is correct
99 Correct 705 ms 1904 KB Output is correct
100 Correct 127 ms 1904 KB Output is correct