Submission #1064007

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064007		Ignut	Toy Train (IOI17_train)	C++17	0 / 100	1100 ms	1372 KiB

train

// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 5555;
int n, m;

vector<int> a, r;

vector<int> g[N];

bool ans = false;

int used[N];

int cntR[N];

int currR = 0;

void dfs(int v) {
    used[v] = 1;
    currR += r[v];
    cntR[v] = currR;
    for (int to : g[v]) {
        if (used[to] == 1) {
            if (cntR[to] != currR) ans = true;
        }
        else if (used[to] == 0) {
            dfs(to);
        }
    }
    used[v] = 2;
}

vector<int> who_wins(vector<int> A, vector<int> R, vector<int> u, vector<int> v) {
    n = A.size(), m = u.size();
    a = A, r = R;
    for (int i = 0; i < m; i ++) {
        g[u[i]].push_back(v[i]);
    }
    vector<int> res;
    for (int s = 0; s < n; s ++) {
        ans = false;
        for (int i = 0; i < n; i ++) used[i] = 0;
        dfs(s);
        res.push_back(ans);
    }
    return res;
}

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