oj.uz

Submission #61153

# Submission time Handle Problem Language Result Execution time Memory
61153 2018-07-25T09:06:36 Z zadrga Toy Train (IOI17_train) C++14
100 / 100
 635 ms 14408 KB 
#include "train.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (2e9)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 5111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;

vector<int> adj[maxn], ch, start;
bool used[maxn];

int deg[maxn], cur_deg[maxn], mark[maxn];
int owner[maxn];

queue<int> q;

void BFS(int n, int col){
	for(int i = 0; i < n; i++){
		mark[i] = 0;
		cur_deg[i] = (owner[i] == col) ? 1 : deg[i];
	}

	for(int v : start){
		mark[v] = 1;
		q.push(v);
	}

	while(!q.empty()){
		int x = q.front();
		q.pop();

		for(int v : adj[x]){
			if(used[v] || mark[v])
				continue;

			cur_deg[v]--;
			if(cur_deg[v] == 0){
				mark[v] = 1;
				q.push(v);
			}
		}
	}
}


vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
	int n = a.size();
	for(int i = 0; i < n; i++)
		owner[i] = a[i];

	for(int i = 0; i < n; i++){
		if(r[i])
			ch.pb(i);
	}

	for(int i = 0; i < u.size(); i++){
		adj[v[i]].pb(u[i]);
		deg[u[i]]++;
	}

	while(1){
		start.clear();
		for(int i = 0; i < ch.size(); i++){
			if(!used[ch[i]])
				start.pb(ch[i]);
		}

		BFS(n, 1);

		start.clear();
		for(int i = 0; i < n; i++){
			if(!used[i] && !mark[i])
				start.pb(i);
		}

		BFS(n, 0);

		bool done = 1;
		for(int i = 0; i < n; i++){
			if(!used[i] && mark[i]){
				used[i] = 1;
				done = 0;
				for(int v : adj[i])
					deg[v]--;
			}
		}

		if(done)
			break;
	}

	vector<int> ans;
	for(int i = 0; i < n; i++)
		ans.pb(!used[i]);

	return ans;
}

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:65:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < u.size(); i++){
                 ~~^~~~~~~~~~
train.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ch.size(); i++){
                  ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1016 KB Output is correct
2 Correct 13 ms 1240 KB Output is correct
3 Correct 12 ms 1240 KB Output is correct
4 Correct 9 ms 1320 KB Output is correct
5 Correct 9 ms 1560 KB Output is correct
6 Correct 8 ms 1700 KB Output is correct
7 Correct 8 ms 1720 KB Output is correct
8 Correct 11 ms 1740 KB Output is correct
9 Correct 10 ms 1888 KB Output is correct
10 Correct 8 ms 2032 KB Output is correct
11 Correct 7 ms 2240 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 2584 KB Output is correct
2 Correct 184 ms 2584 KB Output is correct
3 Correct 264 ms 2584 KB Output is correct
4 Correct 17 ms 2584 KB Output is correct
5 Correct 21 ms 2712 KB Output is correct
6 Correct 14 ms 2920 KB Output is correct
7 Correct 17 ms 3128 KB Output is correct
8 Correct 13 ms 3336 KB Output is correct
9 Correct 11 ms 3544 KB Output is correct
10 Correct 13 ms 3736 KB Output is correct
11 Correct 15 ms 4000 KB Output is correct
12 Correct 11 ms 4000 KB Output is correct
13 Correct 12 ms 4308 KB Output is correct
14 Correct 13 ms 4516 KB Output is correct
15 Correct 18 ms 4724 KB Output is correct
16 Correct 18 ms 4932 KB Output is correct
17 Correct 14 ms 5140 KB Output is correct
18 Correct 418 ms 5140 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5208 KB Output is correct
2 Correct 12 ms 5280 KB Output is correct
3 Correct 16 ms 5644 KB Output is correct
4 Correct 19 ms 5852 KB Output is correct
5 Correct 15 ms 6064 KB Output is correct
6 Correct 17 ms 6268 KB Output is correct
7 Correct 15 ms 6460 KB Output is correct
8 Correct 13 ms 6628 KB Output is correct
9 Correct 12 ms 6864 KB Output is correct
10 Correct 17 ms 7048 KB Output is correct
11 Correct 15 ms 7256 KB Output is correct
12 Correct 16 ms 7464 KB Output is correct
13 Correct 18 ms 7672 KB Output is correct
14 Correct 15 ms 7752 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 7940 KB Output is correct
2 Correct 14 ms 8068 KB Output is correct
3 Correct 13 ms 8276 KB Output is correct
4 Correct 17 ms 8356 KB Output is correct
5 Correct 4 ms 8356 KB Output is correct
6 Correct 10 ms 8356 KB Output is correct
7 Correct 9 ms 8380 KB Output is correct
8 Correct 10 ms 8644 KB Output is correct
9 Correct 11 ms 8664 KB Output is correct
10 Correct 5 ms 8664 KB Output is correct
11 Correct 9 ms 8740 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1016 KB Output is correct
2 Correct 13 ms 1240 KB Output is correct
3 Correct 12 ms 1240 KB Output is correct
4 Correct 9 ms 1320 KB Output is correct
5 Correct 9 ms 1560 KB Output is correct
6 Correct 8 ms 1700 KB Output is correct
7 Correct 8 ms 1720 KB Output is correct
8 Correct 11 ms 1740 KB Output is correct
9 Correct 10 ms 1888 KB Output is correct
10 Correct 8 ms 2032 KB Output is correct
11 Correct 7 ms 2240 KB Output is correct
12 Correct 3 ms 2240 KB Output is correct
13 Correct 2 ms 2240 KB Output is correct
14 Correct 2 ms 2240 KB Output is correct
15 Correct 4 ms 2240 KB Output is correct
16 Correct 3 ms 2240 KB Output is correct
17 Correct 4 ms 2240 KB Output is correct
18 Correct 3 ms 2240 KB Output is correct
19 Correct 3 ms 2240 KB Output is correct
20 Correct 3 ms 2240 KB Output is correct
21 Correct 3 ms 2240 KB Output is correct
22 Correct 3 ms 2240 KB Output is correct
23 Correct 3 ms 2240 KB Output is correct
24 Correct 5 ms 2240 KB Output is correct
25 Correct 3 ms 2240 KB Output is correct
26 Correct 3 ms 2240 KB Output is correct
27 Correct 3 ms 2240 KB Output is correct
28 Correct 3 ms 2240 KB Output is correct
29 Correct 3 ms 2240 KB Output is correct
30 Correct 3 ms 2240 KB Output is correct
31 Correct 3 ms 2240 KB Output is correct
32 Correct 99 ms 2584 KB Output is correct
33 Correct 184 ms 2584 KB Output is correct
34 Correct 264 ms 2584 KB Output is correct
35 Correct 17 ms 2584 KB Output is correct
36 Correct 21 ms 2712 KB Output is correct
37 Correct 14 ms 2920 KB Output is correct
38 Correct 17 ms 3128 KB Output is correct
39 Correct 13 ms 3336 KB Output is correct
40 Correct 11 ms 3544 KB Output is correct
41 Correct 13 ms 3736 KB Output is correct
42 Correct 15 ms 4000 KB Output is correct
43 Correct 11 ms 4000 KB Output is correct
44 Correct 12 ms 4308 KB Output is correct
45 Correct 13 ms 4516 KB Output is correct
46 Correct 18 ms 4724 KB Output is correct
47 Correct 18 ms 4932 KB Output is correct
48 Correct 14 ms 5140 KB Output is correct
49 Correct 418 ms 5140 KB Output is correct
50 Correct 12 ms 5208 KB Output is correct
51 Correct 12 ms 5280 KB Output is correct
52 Correct 16 ms 5644 KB Output is correct
53 Correct 19 ms 5852 KB Output is correct
54 Correct 15 ms 6064 KB Output is correct
55 Correct 17 ms 6268 KB Output is correct
56 Correct 15 ms 6460 KB Output is correct
57 Correct 13 ms 6628 KB Output is correct
58 Correct 12 ms 6864 KB Output is correct
59 Correct 17 ms 7048 KB Output is correct
60 Correct 15 ms 7256 KB Output is correct
61 Correct 16 ms 7464 KB Output is correct
62 Correct 18 ms 7672 KB Output is correct
63 Correct 15 ms 7752 KB Output is correct
64 Correct 15 ms 7940 KB Output is correct
65 Correct 14 ms 8068 KB Output is correct
66 Correct 13 ms 8276 KB Output is correct
67 Correct 17 ms 8356 KB Output is correct
68 Correct 4 ms 8356 KB Output is correct
69 Correct 10 ms 8356 KB Output is correct
70 Correct 9 ms 8380 KB Output is correct
71 Correct 10 ms 8644 KB Output is correct
72 Correct 11 ms 8664 KB Output is correct
73 Correct 5 ms 8664 KB Output is correct
74 Correct 9 ms 8740 KB Output is correct
75 Correct 124 ms 9352 KB Output is correct
76 Correct 213 ms 9468 KB Output is correct
77 Correct 293 ms 9852 KB Output is correct
78 Correct 336 ms 10072 KB Output is correct
79 Correct 348 ms 10280 KB Output is correct
80 Correct 14 ms 10360 KB Output is correct
81 Correct 14 ms 10652 KB Output is correct
82 Correct 16 ms 10864 KB Output is correct
83 Correct 14 ms 10992 KB Output is correct
84 Correct 20 ms 11200 KB Output is correct
85 Correct 16 ms 11368 KB Output is correct
86 Correct 15 ms 11540 KB Output is correct
87 Correct 14 ms 11824 KB Output is correct
88 Correct 18 ms 12032 KB Output is correct
89 Correct 17 ms 12240 KB Output is correct
90 Correct 24 ms 12520 KB Output is correct
91 Correct 17 ms 12688 KB Output is correct
92 Correct 40 ms 12896 KB Output is correct
93 Correct 33 ms 13104 KB Output is correct
94 Correct 33 ms 13312 KB Output is correct
95 Correct 33 ms 13592 KB Output is correct
96 Correct 92 ms 13728 KB Output is correct
97 Correct 372 ms 13916 KB Output is correct
98 Correct 635 ms 14124 KB Output is correct
99 Correct 591 ms 14408 KB Output is correct
100 Correct 409 ms 14408 KB Output is correct