oj.uz

답안 #168084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168084 2019-12-11T09:43:39 Z dolphingarlic 장난감 기차 (IOI17_train) C++14
100 / 100
 1039 ms 1528 KB 
#include "train.h"
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;
 
vector<int> graph[5000];
bool arezou[5000], charging[5000], inactive[5000];
bool in_f_a[5000], in_f_b[5000];
int f_a, f_b, deg_in[5000];
 
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size(), m = u.size();
	// Reverse edges
	FOR(i, 0, m) graph[v[i]].push_back(u[i]);
	FOR(i, 0, n) arezou[i] = a[i], charging[i] = r[i];
 
	vector<int> stations(n);
	FOR(i, 0, n) stations[i] = i;
	
	vector<int> res(n, 0);
	while (true) {
		for (int i : stations) {
			in_f_a[i] = in_f_b[i] = false;
			deg_in[i] = 0;
		}
		f_a = f_b = 0;
 
		FOR(i, 0, m) if (!inactive[u[i]] && !inactive[v[i]]) deg_in[u[i]]++;
 
		queue<int> q;
 
		for (int i : stations) if (charging[i]) {
			in_f_a[i] = true;
			f_a++;
			q.push(i);
		}
		while (q.size()) {
			int curr = q.front();
			q.pop();
			for (int i : graph[curr]) {
				deg_in[i]--;
				if (!in_f_a[i] && !inactive[i] && (arezou[i] || !deg_in[i])) {
					q.push(i);
					in_f_a[i] = true;
					f_a++;
				}
			}
		}
		if (f_a == stations.size()) {
			for (int i : stations) res[i] = true;
			break;
		}
 
		for (int i : stations) deg_in[i] = 0;
		FOR(i, 0, m) if (!inactive[u[i]] && !inactive[v[i]]) deg_in[u[i]]++;
 
		for (int i : stations) if (!in_f_a[i]) {
			in_f_b[i] = true;
			f_b++;
			q.push(i);
		}
		while (q.size()) {
			int curr = q.front();
			q.pop();
			for (int i : graph[curr]) {
				deg_in[i]--;
				if (!in_f_b[i] && !inactive[i] && (!arezou[i] || !deg_in[i])) {
					q.push(i);
					in_f_b[i] = true;
					f_b++;
				}
			}
		}
		if (f_b == stations.size()) break;
 
		vector<int> new_stations;
		for (int i : stations) {
			if (!in_f_b[i]) new_stations.push_back(i);
			else inactive[i] = true;
		}
		stations = new_stations;
	}
 
	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:49:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (f_a == stations.size()) {
       ~~~~^~~~~~~~~~~~~~~~~~
train.cpp:74:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (f_b == stations.size()) break;
       ~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1020 KB Output is correct
2 Correct 8 ms 1016 KB Output is correct
3 Correct 8 ms 1016 KB Output is correct
4 Correct 8 ms 1016 KB Output is correct
5 Correct 7 ms 1016 KB Output is correct
6 Correct 7 ms 1016 KB Output is correct
7 Correct 7 ms 888 KB Output is correct
8 Correct 8 ms 1016 KB Output is correct
9 Correct 7 ms 1016 KB Output is correct
10 Correct 7 ms 888 KB Output is correct
11 Correct 6 ms 988 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 1400 KB Output is correct
2 Correct 298 ms 1528 KB Output is correct
3 Correct 417 ms 1400 KB Output is correct
4 Correct 11 ms 1400 KB Output is correct
5 Correct 12 ms 1372 KB Output is correct
6 Correct 12 ms 1400 KB Output is correct
7 Correct 10 ms 1400 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 9 ms 1272 KB Output is correct
10 Correct 10 ms 1400 KB Output is correct
11 Correct 10 ms 1272 KB Output is correct
12 Correct 9 ms 1272 KB Output is correct
13 Correct 10 ms 1400 KB Output is correct
14 Correct 10 ms 1400 KB Output is correct
15 Correct 10 ms 1272 KB Output is correct
16 Correct 10 ms 1400 KB Output is correct
17 Correct 11 ms 1400 KB Output is correct
18 Correct 616 ms 1144 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1144 KB Output is correct
2 Correct 10 ms 1272 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 11 ms 1272 KB Output is correct
5 Correct 10 ms 1272 KB Output is correct
6 Correct 10 ms 1272 KB Output is correct
7 Correct 10 ms 1272 KB Output is correct
8 Correct 10 ms 1272 KB Output is correct
9 Correct 10 ms 1272 KB Output is correct
10 Correct 10 ms 1272 KB Output is correct
11 Correct 10 ms 1400 KB Output is correct
12 Correct 10 ms 1400 KB Output is correct
13 Correct 10 ms 1400 KB Output is correct
14 Correct 10 ms 1272 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1272 KB Output is correct
2 Correct 10 ms 1272 KB Output is correct
3 Correct 11 ms 1400 KB Output is correct
4 Correct 9 ms 1272 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 7 ms 1016 KB Output is correct
8 Correct 8 ms 1144 KB Output is correct
9 Correct 8 ms 1016 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 7 ms 1016 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1020 KB Output is correct
2 Correct 8 ms 1016 KB Output is correct
3 Correct 8 ms 1016 KB Output is correct
4 Correct 8 ms 1016 KB Output is correct
5 Correct 7 ms 1016 KB Output is correct
6 Correct 7 ms 1016 KB Output is correct
7 Correct 7 ms 888 KB Output is correct
8 Correct 8 ms 1016 KB Output is correct
9 Correct 7 ms 1016 KB Output is correct
10 Correct 7 ms 888 KB Output is correct
11 Correct 6 ms 988 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 166 ms 1400 KB Output is correct
33 Correct 298 ms 1528 KB Output is correct
34 Correct 417 ms 1400 KB Output is correct
35 Correct 11 ms 1400 KB Output is correct
36 Correct 12 ms 1372 KB Output is correct
37 Correct 12 ms 1400 KB Output is correct
38 Correct 10 ms 1400 KB Output is correct
39 Correct 11 ms 1400 KB Output is correct
40 Correct 9 ms 1272 KB Output is correct
41 Correct 10 ms 1400 KB Output is correct
42 Correct 10 ms 1272 KB Output is correct
43 Correct 9 ms 1272 KB Output is correct
44 Correct 10 ms 1400 KB Output is correct
45 Correct 10 ms 1400 KB Output is correct
46 Correct 10 ms 1272 KB Output is correct
47 Correct 10 ms 1400 KB Output is correct
48 Correct 11 ms 1400 KB Output is correct
49 Correct 616 ms 1144 KB Output is correct
50 Correct 9 ms 1144 KB Output is correct
51 Correct 10 ms 1272 KB Output is correct
52 Correct 10 ms 1408 KB Output is correct
53 Correct 11 ms 1272 KB Output is correct
54 Correct 10 ms 1272 KB Output is correct
55 Correct 10 ms 1272 KB Output is correct
56 Correct 10 ms 1272 KB Output is correct
57 Correct 10 ms 1272 KB Output is correct
58 Correct 10 ms 1272 KB Output is correct
59 Correct 10 ms 1272 KB Output is correct
60 Correct 10 ms 1400 KB Output is correct
61 Correct 10 ms 1400 KB Output is correct
62 Correct 10 ms 1400 KB Output is correct
63 Correct 10 ms 1272 KB Output is correct
64 Correct 11 ms 1272 KB Output is correct
65 Correct 10 ms 1272 KB Output is correct
66 Correct 11 ms 1400 KB Output is correct
67 Correct 9 ms 1272 KB Output is correct
68 Correct 2 ms 504 KB Output is correct
69 Correct 6 ms 888 KB Output is correct
70 Correct 7 ms 1016 KB Output is correct
71 Correct 8 ms 1144 KB Output is correct
72 Correct 8 ms 1016 KB Output is correct
73 Correct 4 ms 632 KB Output is correct
74 Correct 7 ms 1016 KB Output is correct
75 Correct 258 ms 1404 KB Output is correct
76 Correct 295 ms 1400 KB Output is correct
77 Correct 418 ms 1400 KB Output is correct
78 Correct 411 ms 1528 KB Output is correct
79 Correct 412 ms 1400 KB Output is correct
80 Correct 11 ms 1400 KB Output is correct
81 Correct 11 ms 1400 KB Output is correct
82 Correct 12 ms 1400 KB Output is correct
83 Correct 12 ms 1400 KB Output is correct
84 Correct 13 ms 1252 KB Output is correct
85 Correct 11 ms 1372 KB Output is correct
86 Correct 13 ms 1400 KB Output is correct
87 Correct 10 ms 1272 KB Output is correct
88 Correct 16 ms 1364 KB Output is correct
89 Correct 11 ms 1272 KB Output is correct
90 Correct 21 ms 1444 KB Output is correct
91 Correct 21 ms 1400 KB Output is correct
92 Correct 39 ms 1400 KB Output is correct
93 Correct 39 ms 1400 KB Output is correct
94 Correct 37 ms 1400 KB Output is correct
95 Correct 41 ms 1400 KB Output is correct
96 Correct 119 ms 1272 KB Output is correct
97 Correct 695 ms 1528 KB Output is correct
98 Correct 979 ms 1400 KB Output is correct
99 Correct 1039 ms 1400 KB Output is correct
100 Correct 614 ms 1144 KB Output is correct