Submission #1025622

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025622		AmirAli_H1	Toy Train (IOI17_train)	C++17	11 / 100	609 ms	13692 KiB

train

// In the name of Allah

#include <bits/stdc++.h>
#include "train.h"
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		X						real()
#define		Y						imag()
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5 + 7;

int n, m;
vector<int> adj[maxn], adjr[maxn];
pii A[maxn]; int D[maxn];
int mark[maxn]; queue<int> qu;
vector<int> res;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> ux, vector<int> vx) {
	n = len(a); m = len(ux);
	for (int i = 0; i < n; i++) A[i] = Mp(a[i], r[i]);
	for (int i = 0; i < m; i++) {
		int u = ux[i], v = vx[i];
		adj[u].pb(v); adjr[v].pb(u);
	}
	
	res.resize(n); fill(all(res), 1);
	for (int v = 0; v < n; v++) {
		if (A[v].S != 0) continue;
		fill(mark, mark + n, 0);
		for (int i = 0; i < n; i++) {
			D[i] = len(adj[i]);
		}
		mark[v] = 1; qu.push(v);
		while (!qu.empty()) {
			int v = qu.front(); qu.pop();
			for (int u : adjr[v]) {
				D[u]--;
				if (A[u].S != 0) continue;
				if (!mark[u]) {
					if (A[u].F == 0) {
						qu.push(u); mark[u] = 1;
					}
					else if (D[u] == 0) {
						qu.push(u); mark[u] = 1;
					}
				}
			}
		}
		if (A[v].F == 1 && D[v] != 0) continue;
		if (A[v].F == 0 && D[v] == len(adj[v])) continue;
		
		for (int i = 0; i < n; i++) {
			D[i] = len(adj[i]);
			if (mark[i]) {
				qu.push(i);
			}
		}
		while (!qu.empty()) {
			int v = qu.front(); qu.pop();
			for (int u : adjr[v]) {
				D[u]--;
				if (!mark[u]) {
					if (A[u].F == 0) {
						qu.push(u); mark[u] = 1;
					}
					else if (D[u] == 0) {
						qu.push(u); mark[u] = 1;
					}
				}
			}
		}
		
		for (int i = 0; i < n; i++) res[i] &= !mark[i];
	}
	return res;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51