oj.uz

Submission #752296

# Submission time Handle Problem Language Result Execution time Memory
752296 2023-06-02T16:55:37 Z definitelynotmee Toy Train (IOI17_train) C++17
100 / 100
 475 ms 1592 KB 
#include "train.h"
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using bstring = basic_string<T>;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 998244353;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	int n = a.size();

	vector<bstring<int>> g(n), rev(n);

	for(int i = 0; i < u.size(); i++){
		g[u[i]].push_back(v[i]);
		rev[v[i]].push_back(u[i]);
	}

	vector<int> resp(n,1);

	auto topo_sort=[&]{

		vector<int> degree(n);
		vector<int> reach(n);
		vector<int> st;

		for(int i = 0; i < n; i++){
			if(!resp[i])
				continue;

			if(a[i]){
				for(int j : g[i]){
					if(resp[j] && r[j]){
						st.push_back(i);
						degree[i] = -1;
						break;
					}
				}
			} else {
				for(int j : g[i]){
					degree[i]+=!(resp[j] && r[j]);
				}

				if(degree[i] == 0)
					st.push_back(i);
			}
		}

		while(!st.empty()){
			int cur = st.back();
			st.pop_back();
			reach[cur] = 1;

			for(int i : rev[cur]){
				if(!resp[i])
					continue;
				
				if(a[i]){
					degree[i]--;
					if(degree[i] == -1){
						st.push_back(i);
					}
				} else {
					if(!r[cur]){
						degree[i]--;
						if(degree[i] == 0){
							st.push_back(i);
						}
					}
				}
			}
		}

		bool ret = 0;

		for(int i = 0; i < n; i++){
			ret|=reach[i]^resp[i];
			resp[i]=reach[i];
		}

		return ret;
	};

	while(topo_sort()){}

	return resp;
}

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:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i = 0; i < u.size(); i++){
      |                 ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 960 KB Output is correct
3 Correct 6 ms 980 KB Output is correct
4 Correct 7 ms 980 KB Output is correct
5 Correct 6 ms 956 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 980 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 4 ms 848 KB Output is correct
11 Correct 3 ms 828 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 304 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 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 0 ms 304 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 1236 KB Output is correct
2 Correct 174 ms 1236 KB Output is correct
3 Correct 238 ms 1236 KB Output is correct
4 Correct 7 ms 1364 KB Output is correct
5 Correct 12 ms 1376 KB Output is correct
6 Correct 9 ms 1364 KB Output is correct
7 Correct 7 ms 1364 KB Output is correct
8 Correct 7 ms 1236 KB Output is correct
9 Correct 6 ms 1108 KB Output is correct
10 Correct 6 ms 1236 KB Output is correct
11 Correct 7 ms 1112 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 7 ms 1364 KB Output is correct
14 Correct 8 ms 1364 KB Output is correct
15 Correct 7 ms 1364 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 7 ms 1364 KB Output is correct
18 Correct 207 ms 852 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1108 KB Output is correct
2 Correct 7 ms 1340 KB Output is correct
3 Correct 8 ms 1500 KB Output is correct
4 Correct 7 ms 1492 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 7 ms 1464 KB Output is correct
7 Correct 9 ms 1456 KB Output is correct
8 Correct 7 ms 1340 KB Output is correct
9 Correct 8 ms 1492 KB Output is correct
10 Correct 8 ms 1504 KB Output is correct
11 Correct 7 ms 1592 KB Output is correct
12 Correct 7 ms 1492 KB Output is correct
13 Correct 8 ms 1508 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1236 KB Output is correct
2 Correct 7 ms 1364 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 6 ms 1184 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 7 ms 836 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 2 ms 476 KB Output is correct
11 Correct 5 ms 812 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 960 KB Output is correct
3 Correct 6 ms 980 KB Output is correct
4 Correct 7 ms 980 KB Output is correct
5 Correct 6 ms 956 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 980 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 4 ms 848 KB Output is correct
11 Correct 3 ms 828 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 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 300 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
21 Correct 1 ms 304 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 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 0 ms 304 KB Output is correct
32 Correct 100 ms 1236 KB Output is correct
33 Correct 174 ms 1236 KB Output is correct
34 Correct 238 ms 1236 KB Output is correct
35 Correct 7 ms 1364 KB Output is correct
36 Correct 12 ms 1376 KB Output is correct
37 Correct 9 ms 1364 KB Output is correct
38 Correct 7 ms 1364 KB Output is correct
39 Correct 7 ms 1236 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 6 ms 1236 KB Output is correct
42 Correct 7 ms 1112 KB Output is correct
43 Correct 6 ms 1108 KB Output is correct
44 Correct 7 ms 1364 KB Output is correct
45 Correct 8 ms 1364 KB Output is correct
46 Correct 7 ms 1364 KB Output is correct
47 Correct 7 ms 1364 KB Output is correct
48 Correct 7 ms 1364 KB Output is correct
49 Correct 207 ms 852 KB Output is correct
50 Correct 6 ms 1108 KB Output is correct
51 Correct 7 ms 1340 KB Output is correct
52 Correct 8 ms 1500 KB Output is correct
53 Correct 7 ms 1492 KB Output is correct
54 Correct 8 ms 1408 KB Output is correct
55 Correct 7 ms 1464 KB Output is correct
56 Correct 9 ms 1456 KB Output is correct
57 Correct 7 ms 1340 KB Output is correct
58 Correct 8 ms 1492 KB Output is correct
59 Correct 8 ms 1504 KB Output is correct
60 Correct 7 ms 1592 KB Output is correct
61 Correct 7 ms 1492 KB Output is correct
62 Correct 8 ms 1508 KB Output is correct
63 Correct 7 ms 1364 KB Output is correct
64 Correct 7 ms 1236 KB Output is correct
65 Correct 7 ms 1364 KB Output is correct
66 Correct 8 ms 1236 KB Output is correct
67 Correct 6 ms 1184 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 3 ms 852 KB Output is correct
70 Correct 5 ms 852 KB Output is correct
71 Correct 7 ms 836 KB Output is correct
72 Correct 5 ms 852 KB Output is correct
73 Correct 2 ms 476 KB Output is correct
74 Correct 5 ms 812 KB Output is correct
75 Correct 176 ms 1400 KB Output is correct
76 Correct 216 ms 1444 KB Output is correct
77 Correct 270 ms 1440 KB Output is correct
78 Correct 265 ms 1376 KB Output is correct
79 Correct 270 ms 1448 KB Output is correct
80 Correct 8 ms 1468 KB Output is correct
81 Correct 8 ms 1472 KB Output is correct
82 Correct 9 ms 1464 KB Output is correct
83 Correct 11 ms 1464 KB Output is correct
84 Correct 10 ms 1492 KB Output is correct
85 Correct 8 ms 1468 KB Output is correct
86 Correct 12 ms 1492 KB Output is correct
87 Correct 10 ms 1492 KB Output is correct
88 Correct 19 ms 1492 KB Output is correct
89 Correct 9 ms 1476 KB Output is correct
90 Correct 22 ms 1492 KB Output is correct
91 Correct 23 ms 1492 KB Output is correct
92 Correct 40 ms 1492 KB Output is correct
93 Correct 32 ms 1492 KB Output is correct
94 Correct 36 ms 1508 KB Output is correct
95 Correct 40 ms 1472 KB Output is correct
96 Correct 79 ms 1436 KB Output is correct
97 Correct 278 ms 1592 KB Output is correct
98 Correct 460 ms 1540 KB Output is correct
99 Correct 475 ms 1512 KB Output is correct
100 Correct 217 ms 1040 KB Output is correct