oj.uz

답안 #53442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
53442 2018-06-30T03:46:20 Z ainta 장난감 기차 (IOI17_train) C++17
15 / 100
 2000 ms 1956 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;
			}
		}
	}
	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)continue;
			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] + D[x] && D[t] < r[t] + d) {
						C[t]--;
						if (!C[t]) {
							if (!InQ[t]) {
								InQ[t] = 1;
								Q.push(t);
							}
						}
					}
				}
			}
			D[x] = d;
		}
		else {
			int d = 1e9;
			for (auto &t : E[x]) {
				d = min(d, D[t] + r[x]);
			}
			d = min(d, n);
			if (D[x] == d)continue;
			C[x] = 0;
			for (auto &t : E[x]) {
				if (d >= D[t] + r[x])C[x]++;
			}
			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 (t == x)u = d;
					if (u >= r[t] + D[x] && u < 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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 541 ms 1236 KB Output is correct
2 Correct 399 ms 1256 KB Output is correct
3 Correct 415 ms 1328 KB Output is correct
4 Correct 371 ms 1348 KB Output is correct
5 Correct 377 ms 1480 KB Output is correct
6 Correct 412 ms 1480 KB Output is correct
7 Correct 98 ms 1480 KB Output is correct
8 Correct 587 ms 1480 KB Output is correct
9 Correct 506 ms 1560 KB Output is correct
10 Correct 447 ms 1560 KB Output is correct
11 Correct 330 ms 1560 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1560 KB Output is correct
2 Correct 2 ms 1560 KB Output is correct
3 Correct 2 ms 1560 KB Output is correct
4 Correct 3 ms 1560 KB Output is correct
5 Correct 2 ms 1560 KB Output is correct
6 Correct 2 ms 1560 KB Output is correct
7 Correct 2 ms 1560 KB Output is correct
8 Correct 3 ms 1560 KB Output is correct
9 Correct 2 ms 1560 KB Output is correct
10 Correct 3 ms 1560 KB Output is correct
11 Correct 2 ms 1560 KB Output is correct
12 Correct 2 ms 1560 KB Output is correct
13 Correct 3 ms 1560 KB Output is correct
14 Correct 3 ms 1560 KB Output is correct
15 Correct 2 ms 1560 KB Output is correct
16 Correct 2 ms 1560 KB Output is correct
17 Correct 3 ms 1560 KB Output is correct
18 Correct 2 ms 1560 KB Output is correct
19 Correct 2 ms 1560 KB Output is correct
20 Correct 2 ms 1560 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 1708 KB Output is correct
2 Correct 162 ms 1852 KB Output is correct
3 Correct 287 ms 1852 KB Output is correct
4 Correct 1228 ms 1852 KB Output is correct
5 Correct 1353 ms 1856 KB Output is correct
6 Correct 40 ms 1856 KB Output is correct
7 Correct 499 ms 1880 KB Output is correct
8 Correct 825 ms 1956 KB Output is correct
9 Correct 32 ms 1956 KB Output is correct
10 Correct 1149 ms 1956 KB Output is correct
11 Correct 523 ms 1956 KB Output is correct
12 Correct 16 ms 1956 KB Output is correct
13 Execution timed out 2063 ms 1956 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2064 ms 1956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1851 ms 1956 KB Output is correct
2 Execution timed out 2073 ms 1956 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 541 ms 1236 KB Output is correct
2 Correct 399 ms 1256 KB Output is correct
3 Correct 415 ms 1328 KB Output is correct
4 Correct 371 ms 1348 KB Output is correct
5 Correct 377 ms 1480 KB Output is correct
6 Correct 412 ms 1480 KB Output is correct
7 Correct 98 ms 1480 KB Output is correct
8 Correct 587 ms 1480 KB Output is correct
9 Correct 506 ms 1560 KB Output is correct
10 Correct 447 ms 1560 KB Output is correct
11 Correct 330 ms 1560 KB Output is correct
12 Correct 3 ms 1560 KB Output is correct
13 Correct 2 ms 1560 KB Output is correct
14 Correct 2 ms 1560 KB Output is correct
15 Correct 3 ms 1560 KB Output is correct
16 Correct 2 ms 1560 KB Output is correct
17 Correct 2 ms 1560 KB Output is correct
18 Correct 2 ms 1560 KB Output is correct
19 Correct 3 ms 1560 KB Output is correct
20 Correct 2 ms 1560 KB Output is correct
21 Correct 3 ms 1560 KB Output is correct
22 Correct 2 ms 1560 KB Output is correct
23 Correct 2 ms 1560 KB Output is correct
24 Correct 3 ms 1560 KB Output is correct
25 Correct 3 ms 1560 KB Output is correct
26 Correct 2 ms 1560 KB Output is correct
27 Correct 2 ms 1560 KB Output is correct
28 Correct 3 ms 1560 KB Output is correct
29 Correct 2 ms 1560 KB Output is correct
30 Correct 2 ms 1560 KB Output is correct
31 Correct 2 ms 1560 KB Output is correct
32 Correct 80 ms 1708 KB Output is correct
33 Correct 162 ms 1852 KB Output is correct
34 Correct 287 ms 1852 KB Output is correct
35 Correct 1228 ms 1852 KB Output is correct
36 Correct 1353 ms 1856 KB Output is correct
37 Correct 40 ms 1856 KB Output is correct
38 Correct 499 ms 1880 KB Output is correct
39 Correct 825 ms 1956 KB Output is correct
40 Correct 32 ms 1956 KB Output is correct
41 Correct 1149 ms 1956 KB Output is correct
42 Correct 523 ms 1956 KB Output is correct
43 Correct 16 ms 1956 KB Output is correct
44 Execution timed out 2063 ms 1956 KB Time limit exceeded
45 Halted 0 ms 0 KB -