oj.uz

답안 #789659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789659 2023-07-21T16:27:39 Z esomer 장난감 기차 (IOI17_train) C++17
100 / 100
 476 ms 1400 KB 
#include<bits/stdc++.h>
#include "train.h"
 
using namespace std;
 
typedef long long ll;
 
void process(vector<int>& A, vector<int>& R, vector<int>& U, vector<int>& V, vector<bool>& forced, vector<int>& out, vector<vector<int>>& radj){
	int n = (int)A.size();
	int m = (int)U.size();
	queue<int> q;
	for(int i = 0; i < n; i++){
		if(out[i] == 0 || R[i] == 1){
			forced[i] = 0;
			q.push(i);
		}
	}
	vector<int> org = out;
	while(!q.empty()){
		int x = q.front(); q.pop();
		for(int node : radj[x]){
			out[node]--;
			if(forced[node] == 0) continue;
			if(out[node] == 0) {q.push(node); forced[node] = 0;}
			else if(A[node] == 1){
				forced[node] = 0;
				q.push(node);
			}
		}
	}
	out = org;
	for(int i = 0; i < n; i++){
		if(out[i] == 0 || forced[i] == 1){
			q.push(i);
		}
	}
	while(!q.empty()){
		int x = q.front(); q.pop();
		for(int node : radj[x]){
			out[node]--;
			if(forced[node] == 1) continue;
			if(out[node] == 0) {q.push(node); forced[node] = 1;}
			else if(A[node] == 0){
				forced[node] = 1;
				q.push(node);
			}
		}
	}
	out = org;
}
 
vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V){
	int n = (int)A.size();
	int m = (int)U.size();
	vector<bool> forced; //If 1, then it can be forced by B into a cycle with no R's.
	vector<int> out(n);
	vector<vector<int>> radj(n);
	for(int i = 0; i < m; i++){
		radj[V[i]].push_back(U[i]);
		out[U[i]]++;
	}
	bool stop = 0;
	while(!stop){
		stop = 1;
		forced.assign(n, 1);
		process(A, R, U, V, forced, out, radj);
		for(int i = 0; i < n; i++){
			if(forced[i] == 1 && R[i] == 1) {R[i] = 0; stop = 0;}
		}
	}
	vector<int> ans(n);
	for(int i = 0; i < n; i++){
		if(forced[i] == 1) ans[i] = 0;
		else ans[i] = 1;
	}
	return ans;
}

Compilation message

train.cpp: In function 'void process(std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<bool>&, std::vector<int>&, std::vector<std::vector<int> >&)':
train.cpp:10:6: warning: unused variable 'm' [-Wunused-variable]
   10 |  int m = (int)U.size();
      |      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 4 ms 820 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 3 ms 832 KB Output is correct
8 Correct 4 ms 824 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 824 KB Output is correct
11 Correct 4 ms 852 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 1200 KB Output is correct
2 Correct 123 ms 1216 KB Output is correct
3 Correct 168 ms 1216 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 6 ms 1080 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 5 ms 1184 KB Output is correct
8 Correct 6 ms 1132 KB Output is correct
9 Correct 5 ms 1072 KB Output is correct
10 Correct 5 ms 1120 KB Output is correct
11 Correct 5 ms 1108 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 5 ms 1148 KB Output is correct
16 Correct 5 ms 1132 KB Output is correct
17 Correct 5 ms 1108 KB Output is correct
18 Correct 249 ms 956 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 7 ms 1144 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 6 ms 1076 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 6 ms 1204 KB Output is correct
12 Correct 6 ms 1248 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 5 ms 1128 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1112 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 724 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 4 ms 820 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 3 ms 832 KB Output is correct
8 Correct 4 ms 824 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 824 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 0 ms 296 KB Output is correct
29 Correct 0 ms 300 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 61 ms 1200 KB Output is correct
33 Correct 123 ms 1216 KB Output is correct
34 Correct 168 ms 1216 KB Output is correct
35 Correct 6 ms 1108 KB Output is correct
36 Correct 6 ms 1080 KB Output is correct
37 Correct 6 ms 1108 KB Output is correct
38 Correct 5 ms 1184 KB Output is correct
39 Correct 6 ms 1132 KB Output is correct
40 Correct 5 ms 1072 KB Output is correct
41 Correct 5 ms 1120 KB Output is correct
42 Correct 5 ms 1108 KB Output is correct
43 Correct 5 ms 1108 KB Output is correct
44 Correct 5 ms 1108 KB Output is correct
45 Correct 5 ms 1108 KB Output is correct
46 Correct 5 ms 1148 KB Output is correct
47 Correct 5 ms 1132 KB Output is correct
48 Correct 5 ms 1108 KB Output is correct
49 Correct 249 ms 956 KB Output is correct
50 Correct 4 ms 980 KB Output is correct
51 Correct 5 ms 1108 KB Output is correct
52 Correct 5 ms 1108 KB Output is correct
53 Correct 7 ms 1144 KB Output is correct
54 Correct 6 ms 1108 KB Output is correct
55 Correct 6 ms 1108 KB Output is correct
56 Correct 6 ms 1076 KB Output is correct
57 Correct 5 ms 1108 KB Output is correct
58 Correct 5 ms 1108 KB Output is correct
59 Correct 5 ms 1108 KB Output is correct
60 Correct 6 ms 1204 KB Output is correct
61 Correct 6 ms 1248 KB Output is correct
62 Correct 5 ms 1108 KB Output is correct
63 Correct 5 ms 1128 KB Output is correct
64 Correct 5 ms 1108 KB Output is correct
65 Correct 5 ms 1108 KB Output is correct
66 Correct 5 ms 1108 KB Output is correct
67 Correct 5 ms 1112 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 3 ms 852 KB Output is correct
70 Correct 4 ms 852 KB Output is correct
71 Correct 4 ms 852 KB Output is correct
72 Correct 3 ms 852 KB Output is correct
73 Correct 1 ms 468 KB Output is correct
74 Correct 3 ms 724 KB Output is correct
75 Correct 90 ms 1248 KB Output is correct
76 Correct 123 ms 1236 KB Output is correct
77 Correct 173 ms 1276 KB Output is correct
78 Correct 174 ms 1400 KB Output is correct
79 Correct 186 ms 1360 KB Output is correct
80 Correct 6 ms 1212 KB Output is correct
81 Correct 6 ms 1236 KB Output is correct
82 Correct 6 ms 1236 KB Output is correct
83 Correct 6 ms 1208 KB Output is correct
84 Correct 6 ms 1236 KB Output is correct
85 Correct 6 ms 1236 KB Output is correct
86 Correct 6 ms 1236 KB Output is correct
87 Correct 5 ms 1236 KB Output is correct
88 Correct 8 ms 1176 KB Output is correct
89 Correct 6 ms 1236 KB Output is correct
90 Correct 10 ms 1236 KB Output is correct
91 Correct 10 ms 1236 KB Output is correct
92 Correct 17 ms 1280 KB Output is correct
93 Correct 16 ms 1260 KB Output is correct
94 Correct 18 ms 1236 KB Output is correct
95 Correct 19 ms 1276 KB Output is correct
96 Correct 50 ms 1176 KB Output is correct
97 Correct 299 ms 1208 KB Output is correct
98 Correct 429 ms 1360 KB Output is correct
99 Correct 476 ms 1312 KB Output is correct
100 Correct 251 ms 1084 KB Output is correct