oj.uz

Submission #53444

# Submission time Handle Problem Language Result Execution time Memory
53444 2018-06-30T04:07:57 Z ainta Toy Train (IOI17_train) C++17
15 / 100
 2000 ms 1836 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 349 ms 1144 KB Output is correct
2 Correct 330 ms 1144 KB Output is correct
3 Correct 324 ms 1212 KB Output is correct
4 Correct 317 ms 1344 KB Output is correct
5 Correct 309 ms 1344 KB Output is correct
6 Correct 342 ms 1344 KB Output is correct
7 Correct 95 ms 1344 KB Output is correct
8 Correct 459 ms 1344 KB Output is correct
9 Correct 386 ms 1344 KB Output is correct
10 Correct 382 ms 1432 KB Output is correct
11 Correct 278 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 3 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 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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1796 KB Output is correct
2 Correct 146 ms 1796 KB Output is correct
3 Correct 192 ms 1796 KB Output is correct
4 Correct 1169 ms 1832 KB Output is correct
5 Correct 1398 ms 1832 KB Output is correct
6 Correct 38 ms 1832 KB Output is correct
7 Correct 474 ms 1832 KB Output is correct
8 Correct 856 ms 1832 KB Output is correct
9 Correct 20 ms 1832 KB Output is correct
10 Correct 947 ms 1832 KB Output is correct
11 Correct 499 ms 1832 KB Output is correct
12 Correct 12 ms 1832 KB Output is correct
13 Execution timed out 2082 ms 1832 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2076 ms 1832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1968 ms 1836 KB Output is correct
2 Execution timed out 2057 ms 1836 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 1144 KB Output is correct
2 Correct 330 ms 1144 KB Output is correct
3 Correct 324 ms 1212 KB Output is correct
4 Correct 317 ms 1344 KB Output is correct
5 Correct 309 ms 1344 KB Output is correct
6 Correct 342 ms 1344 KB Output is correct
7 Correct 95 ms 1344 KB Output is correct
8 Correct 459 ms 1344 KB Output is correct
9 Correct 386 ms 1344 KB Output is correct
10 Correct 382 ms 1432 KB Output is correct
11 Correct 278 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 3 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 2 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 2 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 81 ms 1796 KB Output is correct
33 Correct 146 ms 1796 KB Output is correct
34 Correct 192 ms 1796 KB Output is correct
35 Correct 1169 ms 1832 KB Output is correct
36 Correct 1398 ms 1832 KB Output is correct
37 Correct 38 ms 1832 KB Output is correct
38 Correct 474 ms 1832 KB Output is correct
39 Correct 856 ms 1832 KB Output is correct
40 Correct 20 ms 1832 KB Output is correct
41 Correct 947 ms 1832 KB Output is correct
42 Correct 499 ms 1832 KB Output is correct
43 Correct 12 ms 1832 KB Output is correct
44 Execution timed out 2082 ms 1832 KB Time limit exceeded
45 Halted 0 ms 0 KB -