Submission #703798

#	Time	Username	Problem	Language	Result	Execution time	Memory
703798		Abrar_Al_Samit	Toy Train (IOI17_train)	C++17	0 / 100	31 ms	1872 KiB

train

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

const int nax = 5000;
int n, m;
vector<int>g[nax], gt[nax];
vector<int>A, R;
vector<int>cr(nax, -1);
vector<int>stk;
bool cyc[nax];
int vis[nax];

void solve(int v) {

	cr[v] = stk.size();
	stk.push_back(v);

	vis[v] = 1;
	for(int u : g[v]) {
		if(cr[u]==-1) {
			if(vis[u]!=2) solve(u);
		} else {
			for(int j=stk.size()-1; j>=cr[u]; --j) {
				cyc[stk[j]] = true;
			}
		}	
	}
	cr[v] = -1;
	stk.pop_back();
	vis[v] = 2;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n = a.size(), m = u.size();
	for(int i=0; i<m; ++i) {
		g[u[i]].push_back(v[i]);
		gt[v[i]].push_back(u[i]);
	}

	A = a, R = r;
	vector<int>res(n);

	for(int i=0; i<n; ++i) if(vis[i]==0) {
		solve(i);
	}

	queue<int>q;
	for(int i=0; i<n; ++i) if(R[i] && cyc[i]) {
		q.push(i);
		res[i] = 1;
	}

	while(!q.empty()) {
		int v = q.front(); q.pop();
		for(int u : gt[v]) if(res[u]!=1) {
			q.push(u);
			res[u] = 1;
		}
	}
	return res;
}

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