Submission #607521

#	Time	Username	Problem	Language	Result	Execution time	Memory
607521		Arturgo	Toy Train (IOI17_train)	C++14	38 / 100	2095 ms	1492 KiB

train

#include "train.h"
#include <deque>
#include <vector>
using namespace std;

vector<int> who_wins(vector<int> estMax, vector<int> estRecharge,
 vector<int> debs, vector<int> fins) {
	int nbSommets = estMax.size();
	
	vector<int> aggregs(nbSommets, 0);
	vector<int> nbMins(nbSommets, 0);
	
	vector<int> scores(nbSommets, 0);
	vector<bool> estDans(nbSommets, true);
	
	vector<vector<int>> fils(nbSommets);
	vector<vector<int>> parents(nbSommets);
	
	for(int iArc = 0;iArc < (int)debs.size();iArc++) {
		fils[debs[iArc]].push_back(fins[iArc]);
		parents[fins[iArc]].push_back(debs[iArc]);
	}
	
	int nbRecharges = 0;
	
	vector<int> file(2 * nbSommets, 0);
	int deb = 0, fin = nbSommets;
	for(int iSommet = 0;iSommet < nbSommets;iSommet++) {
		file[iSommet] = iSommet;
		
		if(estRecharge[iSommet])
			nbRecharges += 1;
	}
	
	while(deb != fin) {
		int sommet = file[deb++];
		deb %= 2 * nbSommets;
		
		if(scores[sommet] != nbRecharges + 1) {
			estDans[sommet] = false;
		}
		else {
			continue;
		}
		
		int oldScore = scores[sommet];
		
		int score;
		if(estMax[sommet]) {
			score = 0;
			
			for(int fil : fils[sommet]) {
				score = max(score, scores[fil]);
			}
		}
		else {
			score = nbRecharges + 2;
			int nb = 0;
			
			for(int fil : fils[sommet]) {
				if(scores[fil] < score) {
					score = scores[fil];
					nb = 0;
				}
				
				if(score == scores[fil]) {
					nb++;
				}
			}
			
			nbMins[sommet] = nb;
		}
		
		aggregs[sommet] = score;
		if(estRecharge[sommet]) {
			score += 1;
		}
		
		if(score > nbRecharges + 1) {
			score = nbRecharges + 1;
			nbMins[sommet] = 1000ll * 1000 * 1000ll;
		}
		
		scores[sommet] = score;
		
		if(score == oldScore) continue;
		
		for(int parent : parents[sommet]) {
			if(estDans[parent]) continue;
			
			if(estMax[parent] && score > aggregs[parent]) {
				file[fin++] = parent;
				fin %= 2 * nbSommets;
				estDans[parent] = true;
			}
			
			if(!estMax[parent] && oldScore == aggregs[parent]) {
				nbMins[parent]--;
				
				if(nbMins[parent] <= 0) {
					file[fin++] = parent;
					fin %= 2 * nbSommets;
					estDans[parent] = true;
				}
			}
		}
	}
	
	vector<int> estGagnant;
	for(int iSommet = 0;iSommet < nbSommets;iSommet++) {
		estGagnant.push_back(scores[iSommet] >= nbRecharges + 1);
	}
	
	return estGagnant;
}

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