oj.uz

답안 #598599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598599 2022-07-18T14:42:51 Z Lucpp 장난감 기차 (IOI17_train) C++17
100 / 100
 1183 ms 1868 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> state;
vector<int> win;
vector<int> deg;
vector<bool> alive;

bool dfs(int u){
	state[u] = 1;
	bool cycle = false;
	for(int v : g[u]){
		if(own[v] == 0 && charge[v] == 0){
			if(state[v] == 0){
				cycle |= dfs(v);
			}
			else if(state[v] == 1) cycle = true;
		}
	}
	state[u] = 2;
	if(cycle) win[u] = 0;
	return cycle;
}

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[U[i]].push_back(V[i]);
	}
	win.assign(n, -1);
	state.assign(n, 0);
	for(int u = 0; u < n; u++){
		if(own[u] == 0 && charge[u] == 0 && state[u] == 0) dfs(u);
	}
	g.clear();
	g.resize(n);
	for(int i = 0; i < (int)U.size(); i++) g[V[i]].push_back(U[i]);
	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 11 ms 1108 KB Output is correct
3 Correct 5 ms 1124 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 5 ms 1108 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 10 ms 1108 KB Output is correct
9 Correct 6 ms 1012 KB Output is correct
10 Correct 5 ms 1032 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 300 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 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 1684 KB Output is correct
2 Correct 503 ms 1584 KB Output is correct
3 Correct 671 ms 1472 KB Output is correct
4 Correct 7 ms 1492 KB Output is correct
5 Correct 9 ms 1492 KB Output is correct
6 Correct 14 ms 1512 KB Output is correct
7 Correct 8 ms 1364 KB Output is correct
8 Correct 8 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 7 ms 1364 KB Output is correct
11 Correct 8 ms 1372 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 9 ms 1620 KB Output is correct
14 Correct 7 ms 1492 KB Output is correct
15 Correct 7 ms 1492 KB Output is correct
16 Correct 7 ms 1492 KB Output is correct
17 Correct 8 ms 1580 KB Output is correct
18 Correct 821 ms 1188 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1236 KB Output is correct
2 Correct 8 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 8 ms 1364 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 10 ms 1364 KB Output is correct
11 Correct 8 ms 1364 KB Output is correct
12 Correct 8 ms 1392 KB Output is correct
13 Correct 7 ms 1364 KB Output is correct
14 Correct 8 ms 1492 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 7 ms 1528 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 9 ms 1396 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 1028 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 5 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 11 ms 1108 KB Output is correct
3 Correct 5 ms 1124 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 5 ms 1108 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 10 ms 1108 KB Output is correct
9 Correct 6 ms 1012 KB Output is correct
10 Correct 5 ms 1032 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 0 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 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 300 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 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 250 ms 1684 KB Output is correct
33 Correct 503 ms 1584 KB Output is correct
34 Correct 671 ms 1472 KB Output is correct
35 Correct 7 ms 1492 KB Output is correct
36 Correct 9 ms 1492 KB Output is correct
37 Correct 14 ms 1512 KB Output is correct
38 Correct 8 ms 1364 KB Output is correct
39 Correct 8 ms 1364 KB Output is correct
40 Correct 7 ms 1364 KB Output is correct
41 Correct 7 ms 1364 KB Output is correct
42 Correct 8 ms 1372 KB Output is correct
43 Correct 7 ms 1236 KB Output is correct
44 Correct 9 ms 1620 KB Output is correct
45 Correct 7 ms 1492 KB Output is correct
46 Correct 7 ms 1492 KB Output is correct
47 Correct 7 ms 1492 KB Output is correct
48 Correct 8 ms 1580 KB Output is correct
49 Correct 821 ms 1188 KB Output is correct
50 Correct 6 ms 1236 KB Output is correct
51 Correct 8 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 8 ms 1364 KB Output is correct
57 Correct 7 ms 1364 KB Output is correct
58 Correct 6 ms 1364 KB Output is correct
59 Correct 10 ms 1364 KB Output is correct
60 Correct 8 ms 1364 KB Output is correct
61 Correct 8 ms 1392 KB Output is correct
62 Correct 7 ms 1364 KB Output is correct
63 Correct 8 ms 1492 KB Output is correct
64 Correct 8 ms 1364 KB Output is correct
65 Correct 7 ms 1528 KB Output is correct
66 Correct 8 ms 1364 KB Output is correct
67 Correct 9 ms 1396 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 1028 KB Output is correct
70 Correct 4 ms 724 KB Output is correct
71 Correct 5 ms 852 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 2 ms 340 KB Output is correct
74 Correct 5 ms 724 KB Output is correct
75 Correct 398 ms 1868 KB Output is correct
76 Correct 568 ms 1784 KB Output is correct
77 Correct 834 ms 1676 KB Output is correct
78 Correct 808 ms 1672 KB Output is correct
79 Correct 823 ms 1676 KB Output is correct
80 Correct 10 ms 1620 KB Output is correct
81 Correct 10 ms 1592 KB Output is correct
82 Correct 11 ms 1608 KB Output is correct
83 Correct 10 ms 1728 KB Output is correct
84 Correct 11 ms 1748 KB Output is correct
85 Correct 10 ms 1620 KB Output is correct
86 Correct 12 ms 1620 KB Output is correct
87 Correct 13 ms 1492 KB Output is correct
88 Correct 16 ms 1596 KB Output is correct
89 Correct 11 ms 1592 KB Output is correct
90 Correct 22 ms 1604 KB Output is correct
91 Correct 20 ms 1616 KB Output is correct
92 Correct 40 ms 1612 KB Output is correct
93 Correct 44 ms 1492 KB Output is correct
94 Correct 42 ms 1596 KB Output is correct
95 Correct 44 ms 1600 KB Output is correct
96 Correct 156 ms 1508 KB Output is correct
97 Correct 683 ms 1588 KB Output is correct
98 Correct 1137 ms 1560 KB Output is correct
99 Correct 1183 ms 1544 KB Output is correct
100 Correct 814 ms 1420 KB Output is correct