Submission #593793

#	Time	Username	Problem	Language	Result	Execution time	Memory
593793		FatihSolak	Toy Train (IOI17_train)	C++17	11 / 100	2068 ms	197432 KiB

train

#include "train.h"
#include <bits/stdc++.h>
#define N 5005
using namespace std;
int path[N][N];
int path2[N][N];
bool special[N];
vector<int> adj[N];
vector<int> adj2[N];
void dfs(int v,int num){
	path[num][v] = 1;
	for(auto u:adj[v]){
		if(!path[num][u]){
			dfs(u,num);
		}
	}
}
void dfs2(int v,int num){
	path2[num][v] = 1;
	for(auto u:adj2[v]){
		if(!path2[num][u]){
			dfs2(u,num);
		}
	}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
	int m = u.size();
	for(int i=0;i<m;i++){
		adj[u[i]].push_back(v[i]);
		if(!r[v[i]])
			adj2[u[i]].push_back(v[i]);
	}
	for(int i = 0;i<n;i++){
		dfs(i,i);
		dfs2(i,i);
	}
	for(int i = 0;i<n;i++){
		if(!r[i]){
			for(auto u:adj[i]){
				if(path2[u][i] && !r[u]){
					special[i] = 1;
				}
			}
		}
	}
	vector<int> res(n);
	for(int i = 0; i < n; i++){
		res[i] = 1;
		for(int j = 0;j<n;j++){
			if(special[j] && path[i][j]){
				res[i] = 0;
			}
		}
	}
	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