Submission #68932

#	Time	Username	Problem	Language	Result	Execution time	Memory
68932		aquablitz11	Toy Train (IOI17_train)	C++14	15 / 100	2072 ms	127908 KiB

train

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include "train.h"
using namespace std;
 
using pii = pair<int, int>;
 
const int N = 5e3+10;
int n, m;
vector<int> G[N], R[N];
bool used[N][N];
int cnt[N][N];
 
vector<int> who_wins(vector<int> A, vector<int> C, vector<int> U, vector<int> V)
{
    // input
    n = A.size();
    m = U.size();
    for (int i = 0; i < m; ++i) {
        G[U[i]].push_back(V[i]);
        R[V[i]].push_back(U[i]);
    }
 
    // winning position
    vector<int> ans(n, 1);
    queue<pii> Q;
    for (int i = 0; i < n; ++i) {
        used[i][0] = true;
        Q.emplace(i, 0);
    }
    while (!Q.empty()) {
        int u = Q.front().first, p = Q.front().second;
        Q.pop();
        if (C[u] && p < n)
            continue;
        if (p == n)
            ans[u] = 0;
        int pl = 1, pr = n;
        if (!C[u]) pl = pr = p+1;
        for (auto v : R[u]) {
            for (int np = pl; np <= pr && np <= n; ++np) {
                ++cnt[v][np];
                if (cnt[v][np] == (A[v] ? (int)G[v].size() : 1) && !used[v][np]) {
                    used[v][np] = true;
                    Q.emplace(v, np);
                }
            }
        }
    }
 
    return ans;
}

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