Submission #427420

#	Time	Username	Problem	Language	Result	Execution time	Memory
427420		JeanBombeur	Toy Train (IOI17_train)	C++17	0 / 100	2005 ms	1276 KiB

train

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

const int MAX_NOEUDS = (5000);

vector <int> Remonte[MAX_NOEUDS];

bool DP[MAX_NOEUDS];

bool Arezou[MAX_NOEUDS];

bool Pris[MAX_NOEUDS];

int Deg[MAX_NOEUDS];

int File[MAX_NOEUDS];
int deb = 0, fin = 0;

int nbNoeuds, nbAretes;

void Reset() {
    deb = 0, fin = 0;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Pris[i] = false;
        Deg[i] = 0;
    }
    for (int i = 0; i < nbNoeuds; i ++)
    {
        for (int dest : Remonte[i])
            Deg[dest] ++;
    }
    return;
}

void Add(int noeud) {
    for (int dest : Remonte[noeud])
    {
        if (!Pris[dest] && Arezou[dest])
        {
            File[fin ++] = dest;
            Pris[dest] = true;
        }
        if (!Pris[dest] && !Arezou[dest] && -- Deg[dest] == 0)
        {
            File[fin ++] = dest;
            Pris[dest] = true;
        }
    }
    return;
}

void Bfs() {
    Reset();
    for (int i = 0; i < nbNoeuds; i ++)
    {
        if (DP[i])
            Add(i);
        DP[i] = false;
    }
    while (deb < fin)
    {
        Add(File[deb ++]);
    }
    for (int i = 0; i < nbNoeuds; i ++)
    {
        if (Pris[i])
            DP[i] = true;
    }
    return;
}

vector<int> who_wins(vector<int> Proprio, vector<int> Energie, vector<int> Left, vector<int> Right) {
    
    nbNoeuds = Proprio.size();
    nbAretes = Left.size();
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Arezou[i] = Proprio[i];
        if (Energie[i])
            DP[i] = true;
    }
    for (int i = 0; i < nbAretes; i ++)
    {
        Remonte[Right[i]].push_back(Left[i]);
    }
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Bfs();
    }
    vector <int> Ans;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Ans.push_back(DP[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