Submission #1304646

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304646		Faggi	Toy Train (IOI17_train)	C++20	5 / 100	2094 ms	327680 KiB

train

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

const int MAXN = 1e5 + 1;

vector<ll> grafo[MAXN];

ll ap[MAXN];
vector<int> ans;
vector<int> A, R;
ll dfs(ll nod, ll pad)
{
    ll win = !A[nod];
    for (auto k : grafo[nod])
    {
        if (k == pad)
            continue;
        if (k != nod && dfs(k, nod) == A[nod])
            win = A[nod];
        if (k == nod && A[nod] == R[nod])
            win = A[nod];
    }
    ans[nod] = win;
    return win;
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{

    ll i, n = sz(a), m = sz(u);
    A = a;
    R = r;
    ans.resize(n, 0);
    for (i = 0; i < m; i++)
    {
        grafo[u[i]].pb(v[i]);
        if (v[i] != u[i])
            ap[v[i]]++;
    }
    for (i = 0; i < n; i++)
        if (ap[i] == 0)
            dfs(i, -1);
    return ans;
}

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