Submission #583965

#	Time	Username	Problem	Language	Result	Execution time	Memory
583965		PiejanVDC	장난감 기차 (IOI17_train)	C++17	11 / 100	600 ms	1292 KiB

train

#include <bits/stdc++.h>
#include "train.h"

using namespace std;

const int mxN = (int)5005;

vector<int>adj[mxN];
vector<bool>vis;

int t;
bool f;

vector<int>R;

bool dfs(int u) {
    if(u == t && f)
        return 1;
    f = 1;
    if(vis[u] || R[u])
        return 0;
    vis[u] = 1;
    for(auto z : adj[u]) {
        if(dfs(z))
            return 1;
    }
    return 0;
}



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

    for(int i = 0 ; i < m ; i++)
        adj[u[i]].push_back(v[i]);

    vector<int>pos(n,0);
    for(int i = 0 ; i < n ; i++) {
        if(!r[i]) {
            vis.clear();
            vis.resize(n,0);
            t = i;
            f = 0;
            pos[i] = dfs(i);
        }
    }

    for(int x = 0 ; x < n ; x++)
        for(int i = 0 ; i < n ; i++) {
            for(auto z : adj[i])
                pos[i] |= pos[z];
        }

    vector<int>ans(n);
    for(int i = 0 ; i < n ; i++)
        ans[i] = 1 - pos[i];
    return ans;
}

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