Submission #765302

#	Time	Username	Problem	Language	Result	Execution time	Memory
765302		marvinthang	Toy Train (IOI17_train)	C++17	100 / 100	660 ms	1364 KiB

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);
		copy(ALL(visited), blocked.begin());
	}
	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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 12 / 12
• Subtask 6: 51 / 51