Submission #733365

#TimeUsernameProblemLanguageResultExecution timeMemory
733365t6twotwoToy Train (IOI17_train)C++17
5 / 100
7 ms724 KiB
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V) {
    int N = A.size();
    int M = U.size();
    vector<int> adj(N);
    for (int i = 0; i < M; i++) {
        adj[U[i]] |= 1 << (V[i] - U[i]);
    }
    vector<int> ans(N);
    for (int i = 0; i < N; i++) {
        auto dfs = [&](auto dfs, int x) -> int {
            if (adj[x] / 1 % 2 == 1) {
                if (A[x] == R[x]) {
                    return A[x];
                }
            }
            if (adj[x] / 2 % 2 == 1) {
                if (dfs(dfs, x + 1) == A[x]) {
                    return A[x];
                }
            }
            return 1 - A[x];
        };
        ans[i] = dfs(dfs, i);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...