제출 #1218712

#제출 시각아이디문제언어결과실행 시간메모리
1218712mariza장난감 기차 (IOI17_train)C++20
0 / 100
4 ms1352 KiB
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=5000;

vector<ll> g[N];
bool c[N];

bool w[N], vis[N]={};
bool dfs(ll curr){
    if(vis[curr]) return w[curr];
    vis[curr]=1;

    w[curr]=c[curr];
    for(auto nxt:g[curr]){
        w[curr]|=dfs(nxt);
    }
    return w[curr];
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	ll n=a.size();
    for(ll i=0; i<n; i++){
        c[i]=r[i];
    }
    ll m=u.size();
    for(ll i=0; i<m; i++){
        g[u[i]].push_back(v[i]);
    }

    dfs(0);
    vector<int> ans;
    for(ll i=0; i<n; i++){
        ans.push_back(w[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...