Submission #1034521

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034521		ALeonidou	Toy Train (IOI17_train)	C++17	0 / 100	5 ms	1884 KiB

train

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

using namespace std;

#define ll int
#define sz(x) (ll)x.size()
#define endl "\n"
#define pb push_back
#define F first
#define S second

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
	for (ll i =0; i<sz(v); i++){
		cout<<v[i]<<" ";
	}
	cout<<endl;
}

vector <vi> adj, radj;
vi vis;
void dfs(ll u){
	vis[u] = 1;
	for (ll i =0; i<sz(radj[u]); i++){
		ll c = radj[u][i];
		if (!vis[c]){
			dfs(c);
		}
	}
}

vi who_wins(vi a, vi r, vi u, vi v) {
	ll n = sz(a), m = sz(u);
	
	adj.assign(n,vi());
	radj.assign(n, vi());
	for(ll i =0; i<m; i++){
		// dbg3(i, u[i], v[i]);
		adj[u[i]].pb(v[i]);
		radj[v[i]].pb(u[i]);
	}

	vis.assign(n,0);
	for (ll i =0; i<n; i++){
		if (!vis[i] && r[i]){
			dfs(i);
		}
	}

	return vis;
}

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