oj.uz

Submission #781223

# Submission time Handle Problem Language Result Execution time Memory
781223 2023-07-13T00:04:41 Z GusterGoose27 Toy Train (IOI17_train) C++17
100 / 100
 349 ms 1860 KB 
#include "train.h"

#include <bits/stdc++.h>

const int MAXN = 5005;
using namespace std;
vector<int> edges[MAXN];
vector<int> rev[MAXN];
int deg[MAXN];
bool owner[MAXN]; // 0 b, 1 a
vector<int> ans;
int n, m;

void activate(int cur) {
	if (ans[cur]) return; // r[i]
	assert(!ans[cur]);
	ans[cur] = 1;
	for (int v: rev[cur]) {
		deg[v]++;
		if ((deg[v] == 1 && owner[v]) || (deg[v] == edges[v].size() && !owner[v])) activate(v);
	}
}

void deactivate(int cur) {
	assert(ans[cur]);
	ans[cur] = 0;
	for (int v: rev[cur]) {
		deg[v]--;
		if ((deg[v] == 0 && owner[v]) || (deg[v] == edges[v].size()-1 && !owner[v])) deactivate(v);
	}
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n = a.size();
	m = u.size();
	for (int i = 0; i < n; i++) owner[i] = a[i];
	for (int i = 0; i < m; i++) {
		edges[u[i]].push_back(v[i]);
		rev[v[i]].push_back(u[i]);
	}
	bool f = 1;
	while (f) {
		f = 0;
		fill(deg, deg+n, 0);
		ans = vector<int>(n, 0);
		for (int i = 0; i < n; i++) {
			if (r[i]) activate(i);
		}
		for (int i = 0; i < n; i++) {
			if (ans[i] && ((deg[i] == 0 && owner[i]) || (deg[i] < edges[i].size() && !owner[i]))) {
				r[i] = 0;
				f = 1;
				break;
			}
		}
	}
	return ans;
}

Compilation message

train.cpp: In function 'void activate(int)':
train.cpp:20:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   if ((deg[v] == 1 && owner[v]) || (deg[v] == edges[v].size() && !owner[v])) activate(v);
      |                                     ~~~~~~~^~~~~~~~~~~~~~~~~~
train.cpp: In function 'void deactivate(int)':
train.cpp:29:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   if ((deg[v] == 0 && owner[v]) || (deg[v] == edges[v].size()-1 && !owner[v])) deactivate(v);
      |                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:50:56: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |    if (ans[i] && ((deg[i] == 0 && owner[i]) || (deg[i] < edges[i].size() && !owner[i]))) {
      |                                                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 1228 KB Output is correct
2 Correct 102 ms 1164 KB Output is correct
3 Correct 86 ms 1168 KB Output is correct
4 Correct 85 ms 1156 KB Output is correct
5 Correct 86 ms 1152 KB Output is correct
6 Correct 81 ms 1064 KB Output is correct
7 Correct 95 ms 1152 KB Output is correct
8 Correct 19 ms 1176 KB Output is correct
9 Correct 74 ms 1128 KB Output is correct
10 Correct 60 ms 1092 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 544 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 548 KB Output is correct
11 Correct 1 ms 544 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 540 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 1796 KB Output is correct
2 Correct 76 ms 1860 KB Output is correct
3 Correct 98 ms 1852 KB Output is correct
4 Correct 9 ms 1748 KB Output is correct
5 Correct 50 ms 1696 KB Output is correct
6 Correct 16 ms 1592 KB Output is correct
7 Correct 6 ms 1608 KB Output is correct
8 Correct 6 ms 1580 KB Output is correct
9 Correct 7 ms 1472 KB Output is correct
10 Correct 7 ms 1600 KB Output is correct
11 Correct 6 ms 1552 KB Output is correct
12 Correct 6 ms 1452 KB Output is correct
13 Correct 6 ms 1748 KB Output is correct
14 Correct 6 ms 1748 KB Output is correct
15 Correct 6 ms 1748 KB Output is correct
16 Correct 7 ms 1748 KB Output is correct
17 Correct 9 ms 1748 KB Output is correct
18 Correct 181 ms 1384 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1316 KB Output is correct
2 Correct 6 ms 1364 KB Output is correct
3 Correct 10 ms 1508 KB Output is correct
4 Correct 179 ms 1508 KB Output is correct
5 Correct 17 ms 1528 KB Output is correct
6 Correct 17 ms 1440 KB Output is correct
7 Correct 37 ms 1500 KB Output is correct
8 Correct 36 ms 1364 KB Output is correct
9 Correct 239 ms 1428 KB Output is correct
10 Correct 6 ms 1492 KB Output is correct
11 Correct 6 ms 1444 KB Output is correct
12 Correct 6 ms 1500 KB Output is correct
13 Correct 6 ms 1500 KB Output is correct
14 Correct 6 ms 1452 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1492 KB Output is correct
2 Correct 6 ms 1620 KB Output is correct
3 Correct 6 ms 1492 KB Output is correct
4 Correct 6 ms 1484 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 4 ms 1096 KB Output is correct
7 Correct 5 ms 1196 KB Output is correct
8 Correct 4 ms 1236 KB Output is correct
9 Correct 4 ms 1188 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 1228 KB Output is correct
2 Correct 102 ms 1164 KB Output is correct
3 Correct 86 ms 1168 KB Output is correct
4 Correct 85 ms 1156 KB Output is correct
5 Correct 86 ms 1152 KB Output is correct
6 Correct 81 ms 1064 KB Output is correct
7 Correct 95 ms 1152 KB Output is correct
8 Correct 19 ms 1176 KB Output is correct
9 Correct 74 ms 1128 KB Output is correct
10 Correct 60 ms 1092 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 1 ms 544 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 548 KB Output is correct
22 Correct 1 ms 544 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 540 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 49 ms 1796 KB Output is correct
33 Correct 76 ms 1860 KB Output is correct
34 Correct 98 ms 1852 KB Output is correct
35 Correct 9 ms 1748 KB Output is correct
36 Correct 50 ms 1696 KB Output is correct
37 Correct 16 ms 1592 KB Output is correct
38 Correct 6 ms 1608 KB Output is correct
39 Correct 6 ms 1580 KB Output is correct
40 Correct 7 ms 1472 KB Output is correct
41 Correct 7 ms 1600 KB Output is correct
42 Correct 6 ms 1552 KB Output is correct
43 Correct 6 ms 1452 KB Output is correct
44 Correct 6 ms 1748 KB Output is correct
45 Correct 6 ms 1748 KB Output is correct
46 Correct 6 ms 1748 KB Output is correct
47 Correct 7 ms 1748 KB Output is correct
48 Correct 9 ms 1748 KB Output is correct
49 Correct 181 ms 1384 KB Output is correct
50 Correct 6 ms 1316 KB Output is correct
51 Correct 6 ms 1364 KB Output is correct
52 Correct 10 ms 1508 KB Output is correct
53 Correct 179 ms 1508 KB Output is correct
54 Correct 17 ms 1528 KB Output is correct
55 Correct 17 ms 1440 KB Output is correct
56 Correct 37 ms 1500 KB Output is correct
57 Correct 36 ms 1364 KB Output is correct
58 Correct 239 ms 1428 KB Output is correct
59 Correct 6 ms 1492 KB Output is correct
60 Correct 6 ms 1444 KB Output is correct
61 Correct 6 ms 1500 KB Output is correct
62 Correct 6 ms 1500 KB Output is correct
63 Correct 6 ms 1452 KB Output is correct
64 Correct 6 ms 1492 KB Output is correct
65 Correct 6 ms 1620 KB Output is correct
66 Correct 6 ms 1492 KB Output is correct
67 Correct 6 ms 1484 KB Output is correct
68 Correct 2 ms 596 KB Output is correct
69 Correct 4 ms 1096 KB Output is correct
70 Correct 5 ms 1196 KB Output is correct
71 Correct 4 ms 1236 KB Output is correct
72 Correct 4 ms 1188 KB Output is correct
73 Correct 2 ms 856 KB Output is correct
74 Correct 4 ms 1108 KB Output is correct
75 Correct 65 ms 1708 KB Output is correct
76 Correct 97 ms 1748 KB Output is correct
77 Correct 123 ms 1748 KB Output is correct
78 Correct 122 ms 1852 KB Output is correct
79 Correct 123 ms 1820 KB Output is correct
80 Correct 6 ms 1584 KB Output is correct
81 Correct 10 ms 1584 KB Output is correct
82 Correct 18 ms 1612 KB Output is correct
83 Correct 76 ms 1668 KB Output is correct
84 Correct 12 ms 1576 KB Output is correct
85 Correct 50 ms 1596 KB Output is correct
86 Correct 30 ms 1580 KB Output is correct
87 Correct 11 ms 1616 KB Output is correct
88 Correct 76 ms 1576 KB Output is correct
89 Correct 33 ms 1608 KB Output is correct
90 Correct 38 ms 1600 KB Output is correct
91 Correct 82 ms 1616 KB Output is correct
92 Correct 82 ms 1636 KB Output is correct
93 Correct 96 ms 1592 KB Output is correct
94 Correct 106 ms 1600 KB Output is correct
95 Correct 92 ms 1604 KB Output is correct
96 Correct 80 ms 1508 KB Output is correct
97 Correct 202 ms 1620 KB Output is correct
98 Correct 318 ms 1564 KB Output is correct
99 Correct 349 ms 1552 KB Output is correct
100 Correct 176 ms 1368 KB Output is correct