제출 #584661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584661		1ne	장난감 기차 (IOI17_train)	C++14	5 / 100	6 ms	1364 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>visited(n,false);
	vector<int>cnt(n,0);
	function<int(int)>dfs = [&](int u){
		if (visited[u])return cnt[u];
		visited[u] = true;
		int ans = 0;
		for (auto x:adj[u]){
			if (a[u] == 1 && r[u] == 1 && x == u){
				ans = (int)adj[u].size();
				break;
			}
			else if (x != u){
				ans+=dfs(x);
			}
			else if (a[u] == 0 && r[u] == 0 && x == u){
				ans = -1;
				break;
			}
			else if (a[u] == 0 && r[u] == 1 && x == u){
				ans++;
			}
		}
		if (a[u] == 1){
			return cnt[u] = (ans > 0);
		}
		return cnt[u] = (ans == (int)adj[u].size());
	};
	for (int i = 0;i<n;++i){
		if (visited[i]){
			ans[i] = cnt[i];
		}
		else{
			ans[i] = dfs(i);
		}
	}
	return ans;
}

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