oj.uz

답안 #598614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598614 2022-07-18T15:12:06 Z Lucpp 장난감 기차 (IOI17_train) C++17
100 / 100
 1150 ms 1660 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> own;
vector<int> charge;
vector<vector<int>> g;
vector<int> win;
vector<int> deg;
vector<bool> alive;

void go(int u){
	for(int i = 0; i < (int)g[u].size(); i++){
		int v = g[u][i];
		if(win[v] != -1) continue;
		if(own[v] == win[u]){
			win[v] = win[u];
			go(v);
		}
		else{
			swap(g[u][i], g[u].back());
			g[u].pop_back();
			i--;
			if(--deg[v] == 0){
				win[v] = win[u];
				go(v);
			}
		}
	}
}

void calcWin(){
	for(int u = 0; u < n; u++){
		if(win[u] != -1) go(u);
	}
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V) {
	own = a;
	charge = r;
	n = (int)a.size();
	g.clear();
	g.resize(n);
	deg.assign(n, 0);
	for(int i = 0; i < (int)U.size(); i++){
		deg[U[i]]++;
		g[V[i]].push_back(U[i]);
	}
	win.assign(n, -1);
	alive.assign(n, true);
	while(true){
		calcWin();
		for(int u = 0; u < n; u++){
			if(win[u] == 0) alive[u] = false;
		}
		win.assign(n, -1);
		for(int u = 0; u < n; u++){
			if(alive[u] && charge[u]) win[u] = 1;
		}
		auto tempG = g;
		auto tempDeg = deg;
		calcWin();
		g = tempG;
		deg = tempDeg;
		bool done = true;
		for(int u = 0; u < n; u++){
			if(alive[u]){
				if(win[u] == -1) done = false, win[u] = 0;
				if(win[u] == 1) win[u] = -1;
			}
		}
		if(done) break;
	}
	vector<int> w(n);
	for(int i = 0; i < n; i++) w[i] = alive[i];
	return w;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 6 ms 1108 KB Output is correct
4 Correct 5 ms 1080 KB Output is correct
5 Correct 5 ms 1108 KB Output is correct
6 Correct 5 ms 1068 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 5 ms 1060 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 4 ms 1064 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 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 234 ms 1660 KB Output is correct
2 Correct 434 ms 1560 KB Output is correct
3 Correct 653 ms 1552 KB Output is correct
4 Correct 7 ms 1364 KB Output is correct
5 Correct 8 ms 1492 KB Output is correct
6 Correct 9 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 7 ms 1436 KB Output is correct
9 Correct 6 ms 1376 KB Output is correct
10 Correct 9 ms 1364 KB Output is correct
11 Correct 7 ms 1324 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 8 ms 1492 KB Output is correct
14 Correct 7 ms 1492 KB Output is correct
15 Correct 7 ms 1492 KB Output is correct
16 Correct 6 ms 1492 KB Output is correct
17 Correct 6 ms 1492 KB Output is correct
18 Correct 790 ms 1176 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 6 ms 1108 KB Output is correct
4 Correct 5 ms 1080 KB Output is correct
5 Correct 5 ms 1108 KB Output is correct
6 Correct 5 ms 1068 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 5 ms 1060 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 4 ms 1064 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 234 ms 1660 KB Output is correct
33 Correct 434 ms 1560 KB Output is correct
34 Correct 653 ms 1552 KB Output is correct
35 Correct 7 ms 1364 KB Output is correct
36 Correct 8 ms 1492 KB Output is correct
37 Correct 9 ms 1364 KB Output is correct
38 Correct 6 ms 1364 KB Output is correct
39 Correct 7 ms 1436 KB Output is correct
40 Correct 6 ms 1376 KB Output is correct
41 Correct 9 ms 1364 KB Output is correct
42 Correct 7 ms 1324 KB Output is correct
43 Correct 8 ms 1236 KB Output is correct
44 Correct 8 ms 1492 KB Output is correct
45 Correct 7 ms 1492 KB Output is correct
46 Correct 7 ms 1492 KB Output is correct
47 Correct 6 ms 1492 KB Output is correct
48 Correct 6 ms 1492 KB Output is correct
49 Correct 790 ms 1176 KB Output is correct
50 Correct 5 ms 1236 KB Output is correct
51 Correct 7 ms 1236 KB Output is correct
52 Correct 7 ms 1364 KB Output is correct
53 Correct 7 ms 1364 KB Output is correct
54 Correct 7 ms 1364 KB Output is correct
55 Correct 7 ms 1364 KB Output is correct
56 Correct 7 ms 1364 KB Output is correct
57 Correct 7 ms 1348 KB Output is correct
58 Correct 6 ms 1236 KB Output is correct
59 Correct 6 ms 1364 KB Output is correct
60 Correct 6 ms 1364 KB Output is correct
61 Correct 6 ms 1364 KB Output is correct
62 Correct 7 ms 1364 KB Output is correct
63 Correct 7 ms 1236 KB Output is correct
64 Correct 7 ms 1364 KB Output is correct
65 Correct 8 ms 1492 KB Output is correct
66 Correct 10 ms 1388 KB Output is correct
67 Correct 7 ms 1364 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 980 KB Output is correct
70 Correct 4 ms 724 KB Output is correct
71 Correct 4 ms 852 KB Output is correct
72 Correct 5 ms 724 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 4 ms 724 KB Output is correct
75 Correct 371 ms 1564 KB Output is correct
76 Correct 545 ms 1548 KB Output is correct
77 Correct 755 ms 1460 KB Output is correct
78 Correct 756 ms 1448 KB Output is correct
79 Correct 770 ms 1456 KB Output is correct
80 Correct 8 ms 1364 KB Output is correct
81 Correct 8 ms 1364 KB Output is correct
82 Correct 9 ms 1364 KB Output is correct
83 Correct 9 ms 1492 KB Output is correct
84 Correct 10 ms 1384 KB Output is correct
85 Correct 10 ms 1392 KB Output is correct
86 Correct 10 ms 1516 KB Output is correct
87 Correct 8 ms 1260 KB Output is correct
88 Correct 14 ms 1364 KB Output is correct
89 Correct 8 ms 1364 KB Output is correct
90 Correct 21 ms 1380 KB Output is correct
91 Correct 18 ms 1380 KB Output is correct
92 Correct 37 ms 1380 KB Output is correct
93 Correct 40 ms 1364 KB Output is correct
94 Correct 40 ms 1364 KB Output is correct
95 Correct 43 ms 1372 KB Output is correct
96 Correct 148 ms 1296 KB Output is correct
97 Correct 663 ms 1360 KB Output is correct
98 Correct 1042 ms 1348 KB Output is correct
99 Correct 1150 ms 1356 KB Output is correct
100 Correct 800 ms 1296 KB Output is correct