Submission #641113

#	Time	Username	Problem	Language	Result	Execution time	Memory
641113		ggoh	Toy Train (IOI17_train)	C++14	11 / 100	132 ms	1236 KiB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
 
int n,m,ch[5005],is[2];
vector<int>G[5005],T;
void f(int p, vector<int> &a)
{
	while(1)
	{
		T.clear();
		for(int i=0;i<n;i++)
		{
			if(ch[i]!=p)
			{
				is[0]=is[1]=0;
				for(auto &k:G[i])
				{
					if(ch[k]==p)is[p]=1;
					else is[1-p]=1;
				}
				if((a[i]==p && is[a[i]]) || (a[i]!=p && !is[a[i]]))T.push_back(i);
			}
		}
		if(!sz(T))break;
		for(auto &k:T)ch[k]=p;
	}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n=sz(a);m=sz(u);
	vector<int> res(n);
	for(int i=0;i<m;i++)G[u[i]].push_back(v[i]);
	for(int i=0;i<n;i++)ch[i]=r[i];
	f(1,a);
	f(0,a);
	for(int i=0;i<n;i++)res[i]=ch[i];
	return res;
}

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