Submission #1074343

#TimeUsernameProblemLanguageResultExecution timeMemory
1074343zehnsechsToy Train (IOI17_train)C++14
0 / 100
5 ms860 KiB
#include "train.h"
#include<bits/stdc++.h>

using namespace std;


void dfs(int v, vector<int>& x, vector<int>& c, vector<vector<int>>& adj, vector<int>& res){
    if (x[v]) res[v]=1;
    cerr << "vertex " << v << '\n';    
    if(res[v]){
        for(int u: adj[v]){
            cerr << "n " << u << '\n';
            if (u==v) continue;
            c[u]--;
            if(c[u]==0 && !res[u]) {
                res[u]=1;
                dfs(u,x,c,adj,res);
            }
        }
    }
}


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> res(n,1);
        vector<int> loop(n,0);
        for(int i=0;i<m;++i){
            if(u[i]==v[i]) loop[u[i]]=1;
        }
        
        res[n-1] = r[n-1];
        for(int i = n-2; i>=0; --i){
		if(a[i] && loop[i]) res[i] = res[i+1] || r[i];
		else if(loop[i]) res[i] = res[i+1] && r[i];
		else res[i] = res[i+1];       
        }

	return res;
}
#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...