Submission #1195729

#TimeUsernameProblemLanguageResultExecution timeMemory
1195729AvianshToy Train (IOI17_train)C++20
0 / 100
3 ms840 KiB
#include "train.h"
#include <bits/stdc++.h>

using namespace std;
bool k = 0;
void cyc(int st, vector<int>g[], bool vis[], int orig, int d){
    vis[st]=1;
    for(int i : g[st]){
        if(i==orig)
            k=1;
        if(vis[i])
            continue;
        cyc(i,g,vis,orig, d+1);
    }
}

bool ch = 0;

void check(int st, vector<int>g[],bool vis[], bool val[]){
    vis[st]=1;
    if(val[st])
        ch=1;
    for(int i : g[st]){
        if(vis[i])
            continue;
        check(i,g,vis,val);
    }
}

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>ans(n);
    int d[n];
    fill(d,d+n,0);
    for(int i = 0;i<m;i++){
        if(u[i]==v[i])
            d[u[i]]=2;
    }
    bool curr = 0;
    for(int i = n-1;i>=0;i--){
        if(i==n-1)
            assert(d[i]==2);
        if(d[i]==2){
            if(r[i]){
                curr=1;
            }
            else{
                curr=0;
            }
        }
        ans[i]=curr;
    }
    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...