Submission #592793

#	Time	Username	Problem	Language	Result	Execution time	Memory
592793		Richem	Toy Train (IOI17_train)	C++14	5 / 100	47 ms	25168 KiB

train

#include <iostream>
#include <vector>

using namespace std;

const int MAX_SOMMET = 5042;

int gagnant[MAX_SOMMET] = {0};

int nbSommet, nbArete;

bool adj[MAX_SOMMET][MAX_SOMMET] = {0};

bool qui[MAX_SOMMET] = {0};
bool recharge[MAX_SOMMET] = {0};

int dfs(int sommet) {
    if(gagnant[sommet] != -1)
        return gagnant[sommet];

    gagnant[sommet] = 1 - qui[sommet];

    for(int voisin = 0; voisin < MAX_SOMMET; voisin++) {
        if(adj[sommet][voisin] == 0)
            continue;

        dfs(voisin);

        gagnant[sommet] = gagnant[voisin];
    }

    return gagnant[sommet];
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    nbSommet = a.size();
    nbArete = u.size();

    for(int i = 0; i < nbSommet; i++) {
        gagnant[i] = -1;
        qui[i] = a[i];
        recharge[i] = r[i];
    }

    for(int id = 0; id < nbArete; id++) {
        if(u[id] == v[id]) {
            if(a[u[id]] == 0 && r[u[id]] == 0) {
                gagnant[u[id]] = 0;
            }
            if(a[u[id]] == 1 && r[u[id]] == 1) {
                gagnant[u[id]] = 1;
            }
        }
        else {
            adj[u[id]][v[id]] = 1;
        }
    }

    for(int sommet = 0; sommet < nbSommet; sommet++)
        dfs(sommet);

    vector<int> rep;

    for(int i = 0; i < nbSommet; i++)
        rep.push_back(gagnant[i]);

    return rep;
}

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