제출 #584684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584684		1ne	Toy Train (IOI17_train)	C++14	0 / 100	2093 ms	1372 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);
	vector<vector<int>>adj(n);
	for (int i = 0;i<m;++i){
		adj[u[i]].push_back(v[i]);
	}
	vector<bool>in_cycle(n,false);
	vector<bool>visited(n,false);
	for (int i = 0;i<n;++i){
		if (!r[i])continue;
		vector<bool>parent(n,-1);
		for (int j = 0;j<n;++j)visited[j] = false;
		function<void(int)>dfs = [&](int u){
			visited[u] = true;
			for (auto x:adj[u]){
				if (x == i){
					int y = u;
					while(y!=x){
						in_cycle[y] = true;
						y = parent[y];
					}
				}
				else if (!visited[x]){
					parent[x] = u;
					dfs(x);
				}
			}
		};
		dfs(i);
	}
	for (int i = 0;i<n;++i){
		visited[i] = false;
	}
	for (int i = 0;i<n;++i){
		if (in_cycle[i]){
			visited[i] = true;
			ans[i] = true;
		}
	}
	function<int(int)>dfs2 = [&](int u){
		if (visited[u])return ans[u];
		visited[u] = true;
		int v = 0;
		for (auto x:adj[u]){
			v|=dfs2(x);
		}
		return ans[u] = v;
	};
	for (int i = 0;i<n;++i){
		if (!visited[i]){
			ans[i] = dfs2(i);
		}
	}
	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