Submission #422326

#	Time	Username	Problem	Language	Result	Execution time	Memory
422326		timmyfeng	Toy Train (IOI17_train)	C++17	23 / 100	289 ms	1740 KiB

train

#include <bits/stdc++.h>
using namespace std;

const int N = 5000;

vector<int> to[N], from[N], a;
bool win[N], visited[N];
int degree[N], n, m;

void bfs() {
    queue<int> que;
    for (int i = 0; i < n; ++i) {
        degree[i] = 0;
        if (visited[i]) {
            que.push(i);
        }
    }

    while (!que.empty()) {
        int u = que.front();
        que.pop();
        for (auto c : from[u]) {
            if (!visited[c]) {
                if (a[c] == 1 || ++degree[c] == (int) to[c].size()) {
                    visited[c] = true;
                    que.push(c);
                }
            }
        }
    }
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = a.size(), m = u.size(), ::a = a;

    for (int i = 0; i < m; ++i) {
        to[u[i]].push_back(v[i]);
        from[v[i]].push_back(u[i]);
    }

    for (int i = 0; i < n; ++i) {
        if (r[i] == 1) {
            fill(visited, visited + n, false);
            visited[i] = true;
            bfs();
            for (auto c : to[i]) {
                win[i] |= visited[c];
            }
        }
    }

    copy(win, win + n, visited);
    bfs();

    return vector<int>(visited, visited + n);
}

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