Submission #257085

#	Time	Username	Problem	Language	Result	Execution time	Memory
257085		GREGOIRELC	Toy Train (IOI17_train)	C++14	0 / 100	18 ms	1408 KiB

train

#include "train.h"
#include <iostream>

using namespace std;

const int MAX_NOEUD = 5e3;
const int MAX_ARC = 2e4;

int nbNoeud, nbArc;
bool estProprietaire[MAX_NOEUD];
bool estRechargeable[MAX_NOEUD];
vector<int> result;
vector<int> graphe[MAX_NOEUD];

bool estPossible(int noeudDepart)
{
	int curNoeud = noeudDepart;
	bool nxtPossible = true;
	bool curPossible = false;	

	while(nxtPossible)
	{
		nxtPossible = false;
		for(int voisin : graphe[curNoeud])
		{
			if(voisin == curNoeud + 1)
			{
				nxtPossible = true;
			}
			if(voisin == curNoeud)
			{
				curPossible = true;
			}
		}
		if(curPossible && !estProprietaire[curNoeud] && !estRechargeable[curNoeud])
		{
			return false;
		}
		if(curPossible && estProprietaire[curNoeud] && estRechargeable[curNoeud])
		{
			return true;
		}
		if(!nxtPossible && curPossible)
		{
			return estRechargeable[curNoeud];
		}
		curNoeud++;
	}
	return false;
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v)
{
	nbNoeud = (int)a.size();
	nbArc = (int)u.size();
	
	for(int iNoeud = 0; iNoeud < nbNoeud; iNoeud++)
	{
		if(a[iNoeud] == 1)
		{
			estProprietaire[iNoeud] = true;
		}
		if(r[iNoeud])
		{
			estRechargeable[iNoeud] = true;
		}
	}
	for(int iArc = 0; iArc < nbArc; iArc++)
	{
		graphe[u[iArc]].push_back(v[iArc]);
	}

	for(int iDep = 0; iDep < nbNoeud; iDep++)
	{
		if(estPossible(iDep))
		{
			result.push_back(1);
		}
		else
		{
			result.push_back(0);
		}
	}
	return result;
}

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