답안 #765294

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
765294	2023-06-24T10:29:41 Z	marvinthang	장난감 기차 (IOI17_train)	C++17	100 / 100	679 ms	1552 KB

train

/*************************************
*    author: marvinthang             *
*    created: 24.06.2023 17:13:38    *
*************************************/

#include "train.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

vector <int> who_wins(vector <int> a, vector <int> r, vector <int> u, vector <int> v) {
	int n = a.size();
	int m = u.size();
	vector <vector <int>> radj(n);
	vector <int> deg(n);
	REP(i, m) {
		radj[v[i]].push_back(u[i]);
	}
	vector <bool> visited(n, false);
	vector <int> blocked(n, false);
	while (true) {
		copy(ALL(blocked), visited.begin());
		function <void(int, int)> dfs = [&] (int u, int t) {
			visited[u] = true;
			for (int v: radj[u]) if (!visited[v] && (a[v] == t || !--deg[v])) dfs(v, t);
		};
		fill(ALL(deg), 0);
		REP(i, m) if (!visited[u[i]] && !visited[v[i]]) ++deg[u[i]];
		REP(i, n) if (r[i] && !visited[i]) dfs(i, 1);
		vector <int> rem;
		REP(i, n) if (!visited[i]) rem.push_back(i);
		if (rem.empty()) break;
		copy(ALL(blocked), visited.begin());
		for (int u: rem) if (!visited[u]) dfs(u, 0);
		REP(i, n) if (visited[i]) blocked[i] = true;
	}
	REP(i, n) blocked[i] ^= 1;
	return blocked;
}

#ifdef LOCAL
#include "train.h"

#include <cstdio>
#include <vector>
#include <cassert>

using namespace std;

int main() {
	file("train");
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> a(n), r(n), u(m), v(m);

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &a[i]));

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));

	for(int i = 0; i < m; i++)
		assert(2 == scanf("%d %d", &u[i], &v[i]));

	vector<int> res = who_wins(a, r, u, v);

	for(int i = 0; i < (int)res.size(); i++)
		printf(i ? " %d" : "%d", res[i]);
	printf("\n");

	return 0;
}
#endif

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	724 KB	Output is correct
2	Correct	4 ms	804 KB	Output is correct
3	Correct	4 ms	724 KB	Output is correct
4	Correct	4 ms	724 KB	Output is correct
5	Correct	3 ms	804 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	724 KB	Output is correct
8	Correct	3 ms	724 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	3 ms	724 KB	Output is correct
11	Correct	2 ms	724 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	1 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	296 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	1 ms	300 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	75 ms	1364 KB	Output is correct
2	Correct	157 ms	1360 KB	Output is correct
3	Correct	249 ms	1344 KB	Output is correct
4	Correct	5 ms	1108 KB	Output is correct
5	Correct	6 ms	1192 KB	Output is correct
6	Correct	7 ms	1204 KB	Output is correct
7	Correct	5 ms	1236 KB	Output is correct
8	Correct	5 ms	1236 KB	Output is correct
9	Correct	5 ms	1236 KB	Output is correct
10	Correct	5 ms	1208 KB	Output is correct
11	Correct	5 ms	1236 KB	Output is correct
12	Correct	5 ms	1204 KB	Output is correct
13	Correct	6 ms	1512 KB	Output is correct
14	Correct	8 ms	1468 KB	Output is correct
15	Correct	5 ms	1464 KB	Output is correct
16	Correct	5 ms	1364 KB	Output is correct
17	Correct	5 ms	1364 KB	Output is correct
18	Correct	406 ms	1116 KB	Output is correct

Subtask #4

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	852 KB	Output is correct
2	Correct	5 ms	980 KB	Output is correct
3	Correct	5 ms	1108 KB	Output is correct
4	Correct	7 ms	1108 KB	Output is correct
5	Correct	5 ms	1060 KB	Output is correct
6	Correct	5 ms	980 KB	Output is correct
7	Correct	5 ms	996 KB	Output is correct
8	Correct	5 ms	980 KB	Output is correct
9	Correct	5 ms	980 KB	Output is correct
10	Correct	5 ms	1000 KB	Output is correct
11	Correct	5 ms	980 KB	Output is correct
12	Correct	5 ms	1072 KB	Output is correct
13	Correct	5 ms	1108 KB	Output is correct
14	Correct	5 ms	980 KB	Output is correct

Subtask #5

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	1108 KB	Output is correct
2	Correct	7 ms	1108 KB	Output is correct
3	Correct	5 ms	1108 KB	Output is correct
4	Correct	5 ms	984 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	4 ms	700 KB	Output is correct
8	Correct	4 ms	724 KB	Output is correct
9	Correct	4 ms	724 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	3 ms	724 KB	Output is correct

Subtask #6

51.0 / 51.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	724 KB	Output is correct
2	Correct	4 ms	804 KB	Output is correct
3	Correct	4 ms	724 KB	Output is correct
4	Correct	4 ms	724 KB	Output is correct
5	Correct	3 ms	804 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	724 KB	Output is correct
8	Correct	3 ms	724 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	3 ms	724 KB	Output is correct
11	Correct	2 ms	724 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	1 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	296 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	1 ms	300 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	75 ms	1364 KB	Output is correct
33	Correct	157 ms	1360 KB	Output is correct
34	Correct	249 ms	1344 KB	Output is correct
35	Correct	5 ms	1108 KB	Output is correct
36	Correct	6 ms	1192 KB	Output is correct
37	Correct	7 ms	1204 KB	Output is correct
38	Correct	5 ms	1236 KB	Output is correct
39	Correct	5 ms	1236 KB	Output is correct
40	Correct	5 ms	1236 KB	Output is correct
41	Correct	5 ms	1208 KB	Output is correct
42	Correct	5 ms	1236 KB	Output is correct
43	Correct	5 ms	1204 KB	Output is correct
44	Correct	6 ms	1512 KB	Output is correct
45	Correct	8 ms	1468 KB	Output is correct
46	Correct	5 ms	1464 KB	Output is correct
47	Correct	5 ms	1364 KB	Output is correct
48	Correct	5 ms	1364 KB	Output is correct
49	Correct	406 ms	1116 KB	Output is correct
50	Correct	6 ms	852 KB	Output is correct
51	Correct	5 ms	980 KB	Output is correct
52	Correct	5 ms	1108 KB	Output is correct
53	Correct	7 ms	1108 KB	Output is correct
54	Correct	5 ms	1060 KB	Output is correct
55	Correct	5 ms	980 KB	Output is correct
56	Correct	5 ms	996 KB	Output is correct
57	Correct	5 ms	980 KB	Output is correct
58	Correct	5 ms	980 KB	Output is correct
59	Correct	5 ms	1000 KB	Output is correct
60	Correct	5 ms	980 KB	Output is correct
61	Correct	5 ms	1072 KB	Output is correct
62	Correct	5 ms	1108 KB	Output is correct
63	Correct	5 ms	980 KB	Output is correct
64	Correct	6 ms	1108 KB	Output is correct
65	Correct	7 ms	1108 KB	Output is correct
66	Correct	5 ms	1108 KB	Output is correct
67	Correct	5 ms	984 KB	Output is correct
68	Correct	1 ms	340 KB	Output is correct
69	Correct	3 ms	724 KB	Output is correct
70	Correct	4 ms	700 KB	Output is correct
71	Correct	4 ms	724 KB	Output is correct
72	Correct	4 ms	724 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	3 ms	724 KB	Output is correct
75	Correct	134 ms	1364 KB	Output is correct
76	Correct	170 ms	1492 KB	Output is correct
77	Correct	239 ms	1548 KB	Output is correct
78	Correct	238 ms	1468 KB	Output is correct
79	Correct	246 ms	1552 KB	Output is correct
80	Correct	5 ms	1212 KB	Output is correct
81	Correct	6 ms	1204 KB	Output is correct
82	Correct	6 ms	1204 KB	Output is correct
83	Correct	6 ms	1364 KB	Output is correct
84	Correct	7 ms	1236 KB	Output is correct
85	Correct	6 ms	1236 KB	Output is correct
86	Correct	7 ms	1236 KB	Output is correct
87	Correct	5 ms	1276 KB	Output is correct
88	Correct	9 ms	1236 KB	Output is correct
89	Correct	6 ms	1236 KB	Output is correct
90	Correct	11 ms	1264 KB	Output is correct
91	Correct	11 ms	1280 KB	Output is correct
92	Correct	22 ms	1308 KB	Output is correct
93	Correct	20 ms	1248 KB	Output is correct
94	Correct	21 ms	1236 KB	Output is correct
95	Correct	23 ms	1240 KB	Output is correct
96	Correct	66 ms	1108 KB	Output is correct
97	Correct	427 ms	1260 KB	Output is correct
98	Correct	622 ms	1236 KB	Output is correct
99	Correct	679 ms	1220 KB	Output is correct
100	Correct	418 ms	1108 KB	Output is correct