Submission #282329

#	Time	Username	Problem	Language	Result	Execution time	Memory
282329		MohamedAhmed04	Toy Train (IOI17_train)	C++14	0 / 100	8 ms	1152 KiB

train

#include <bits/stdc++.h>
#include "train.h"
//#include "grader.cpp"

using namespace std ;

const int MAX = 5010 ;

int A[MAX] , R[MAX] ;
vector< vector<int> >adj(MAX) ;
int n , m ;

int vis[MAX] , mark[MAX] , Ans[MAX] ;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) 
{
	n = a.size() ;
	m = u.size() ;
	for(int i = 0 ; i < m ; ++i)
		adj[u[i]].push_back(v[i]) ;
	vector<int>ans ;
	for(int i = n-1 ; i >= 0 ; --i)
	{
		A[i] = a[i] , R[i] = r[i] ;
		Ans[i] = 0 ;
		for(auto &child : adj[i])
		{
			if(child == i)
			{
				if(R[i] == A[i])
					Ans[i] = 1 ;
			}
			else if(child == i+1)
			{
				if(A[i] && A[i+1] == Ans[i+1])
					Ans[i] = 1 ;
				if(!A[i] && A[i+1] != Ans[i+1])
					Ans[i] = 1 ;
			}
		}
		if(R[i])
			Ans[i] = A[i] ;
	}
	for(int i = 0 ; i < n ; ++i)
		ans.push_back(Ans[i] == A[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