Submission #139980

#	Time	Username	Problem	Language	Result	Execution time	Memory
139980		shashwatchandra	Toy Train (IOI17_train)	C++17	11 / 100	2060 ms	50556 KiB

train

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

#define pb push_back
#define REP(i,n) for(int i = 0;i < n;i++)

const int N = 5001;

bool reach[N][N];
bool reach1[N][N];
int n,m;
vector<int> adj[N];
vector<int> adj1[N];
int source = 0;

void dfs(int u){
	for(int v:adj[u]){
		if(reach[source][v])continue;
		reach[source][v] = 1;
		dfs(v);
	}
}

void dfs1(int u){
	for(int v:adj1[u]){
		if(reach1[source][v])continue;
		reach1[source][v] = 1;
		dfs1(v);
	}
}


vector<int> who_wins(vector<int> a, vector<int> r,vector<int> u, vector<int> v) {
		n = a.size();
		m = u.size();
		REP(i,m){
			adj[u[i]].pb(v[i]);
			if(!r[u[i]] and !r[v[i]]){
				adj1[u[i]].pb(v[i]);
			}
		}
		while(source < n){
			dfs(source);
			dfs1(source);
			source++;
		}
		vector<int> ans;
		REP(i,n){
			bool done = 0;
			REP(j,n){
				if(r[j])continue;
				if(reach[i][j] and reach1[j][j]){
					done = 1;
				}
			}
			ans.pb(!done);
		}
		return ans;
}

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