Submission #1064045

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064045		TheQuantiX	Toy Train (IOI17_train)	C++17	23 / 100	294 ms	1860 KiB

train

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll INF = 1000000000000000000LL;

ll n, m, q, k, x, y, a, c;
vector<ll> G[5000];
vector<ll> Gr[5000];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = a.size();
    m = u.size();
    vector<ll> cnt(n);
    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        G[i].clear();
        Gr[i].clear();
    }
    for (int i = 0; i < m; i++) {
        cnt[u[i]]++;
        G[v[i]].push_back(u[i]);
        Gr[u[i]].push_back(v[i]);
    }
    auto cnt1 = cnt;
    for (int i = 0; i < n; i++) {
        if (r[i]) {
            cnt = cnt1;
            queue<ll> q;
            vector<int> vis(n);
            q.push(i);
            while (!q.empty()) {
                ll x = q.front();
                q.pop();
                if (vis[x]) {
                    continue;
                }
                vis[x] = 1;
                for (auto j : G[x]) {
                    if (a[j] && !vis[j]) {
                        q.push(j);
                    }
                    if (!a[j]) {
                        cnt[j]--;
                        if (cnt[j] == 0 && !vis[j]) {
                            q.push(j);
                        }
                    }
                }
            }
            bool fl;
            if (a[i]) {
                fl = 0;
                for (int j : Gr[i]) {
                    if (vis[j]) {
                        fl = 1;
                        break;
                    }
                }
            }
            else {
                fl = 1;
                for (int j : Gr[i]) {
                    if (!vis[j]) {
                        fl = 0;
                        break;
                    }
                }
            }
            if (fl) {
                for (int j = 0; j < n; j++) {
                    ans[j] |= vis[j];
                }
            }
        }
    }
    return ans;
}

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