Submission #1063999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063999		Ignut	Toy Train (IOI17_train)	C++17	0 / 100	618 ms	1784 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;

bool used[N];

void dfs(int v) {
    used[v] = true;
    ans |= r[v];
    for (int to : g[v])
        if (!used[to])
            dfs(to);
}

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] = false;
        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