제출 #1208253

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208253		Hanksburger	Toy Train (IOI17_train)	C++17	0 / 100	5 ms	1352 KiB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[5005], rev[5005];
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V)
{
	int n=a.size();
	vector<int> cnt(n, 0), ans(n);
	for (int i=0; i<U.size(); i++)
	{
		rev[U[i]].push_back(V[i]);
		adj[V[i]].push_back(U[i]);
		cnt[U[i]]++;
	}
	queue<int> q;
	for (int i=0; i<n; i++)
		if (r[i])
			q.push(i);
	while (!q.empty())
	{
		int u=q.front();
		q.pop();
		for (int v:adj[u])
		{
			if (r[v])
				continue;
			if (a[v] || !(--cnt[v]))
			{
				r[v]=1;
				q.push(v);
			}
		}
	}
	for (int u=0; u<n; u++)
	{
		ans[u]=1-a[u];
		for (int v:adj[u])
			if (a[u]^r[v]^1)
				ans[u]=a[u];
	}
	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