제출 #799858

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

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;

int n, m, dead[5000];
vector<int> E[5000], R[5000];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v)
{
	n = a.size(), m = u.size();
	vector<int> ans(n, 1);
	while (1)
	{
		for (int i = 0; i < n; i++)
			E[i].clear(), R[i].clear();
		for (int i = 0; i < m; i++)
			if (!dead[i])
			{
				E[u[i]].emplace_back(v[i]);
				E[v[i]].emplace_back(u[i]);
			}
		vector<int> req(n), vis(n, 0);
		for (int i = 0; i < n; i++)
			if (!dead[i])
			{
				if (a[i])
					req[i] = 1;
				else
					req[i] = E[i].size();
			}
		queue<int> q;
		for (int i = 0; i < n; i++)
			if (!dead[i] && r[i])
			{
				vis[i] = 1;
				q.emplace(i);
			}

		while (!q.empty())
		{
			int i = q.front();
			q.pop();
			for (auto j : E[i])
				if(--req[j] == 0)
				{
					vis[j] = 1;
					q.emplace(j);
				}
		}

		for (int i = 0; i < n; i++)
			if (!dead[i])
			{
				if (a[i])
					req[i] = E[i].size();
				else
					req[i] = 1;
			}
		for (int i = 0; i < n; i++)
			if(!dead[i] && !vis[i])
				q.emplace(i);
		if(q.empty())
			break;
		fill(vis.begin(), vis.end(), 0);
		while (!q.empty())
		{
			int i = q.front();
			ans[i] = 0, dead[i] = 1;
			q.pop();
			for (auto j : E[i])
				if(--req[j] == 0)
					q.emplace(j);
		}
	}
	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