Submission #584715

#	Time	Username	Problem	Language	Result	Execution time	Memory
584715		1ne	Toy Train (IOI17_train)	C++14	0 / 100	65 ms	1688 KiB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	int n = (int)a.size();
	int m = (int)u.size();
	vector<int>ans(n,0);
	vector<vector<int>>adj(n),adj2(n);
	for (int i = 0;i<m;++i){
		adj[u[i]].push_back(v[i]);
		adj2[v[i]].push_back(u[i]);
	}
	vector<bool>visited(n,false),visited2(n,false);
	function<void(int)>dfs = [&](int u){
		visited[u] = true;
		for (auto x:adj[u]){
			if (!visited[x])dfs(x);
		}
	};	
	function<void(int)>dfs2 = [&](int u){
		visited2[u] = true;
		for (auto x:adj2[u]){
			if (!visited2[x])dfs2(x);
		}
	};	
	for (int i = 0;i<n;++i){
		if (!r[i])continue;
		for (int j = 0;j<n;++j){
			visited[i] = false;
			visited2[i] = false;
		}
		for (auto x:adj[i])dfs(x);
		for (auto x:adj2[i])dfs2(x);
		if (visited[i]){
			for (int j = 0;j<n;++j){
				if (!visited2[j])continue;
				ans[j] =1;
			}
		}
	}
	return ans;
}

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