Submission #584667

#TimeUsernameProblemLanguageResultExecution timeMemory
5846671neToy Train (IOI17_train)C++14
0 / 100
8 ms1004 KiB
#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);
	vector<vector<int>>adj(n);
	for (int i = 0;i<m;++i){
		adj[u[i]].push_back(v[i]);
	}
	vector<bool>visited(n,false);
	vector<int>cnt(n,0);
	function<int(int,int)>dfs = [&](int u,int got){
		visited[u] = true;
		int ans = 0;
		for (auto x:adj[u]){
			if (visited[u] && got){
				ans = 1;
				break;
			}
			else if (visited[u]){
				continue;
			}
			ans|=dfs(x,(got|(r[u] == 1)));
		}
		return cnt[u] = ans;
	};
	for (int i = 0;i<n;++i){
		if (visited[i]){
			ans[i] = cnt[i];
		}
		else{
			ans[i] = dfs(i,0);
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...