Submission #812703

#TimeUsernameProblemLanguageResultExecution timeMemory
812703Dan4LifeToy Train (IOI17_train)C++17
5 / 100
2068 ms980 KiB
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)5e3+10;
vi adj[mxN];

vi who_wins(vi a, vi r, vi u, vi v) {
	int n = sz(a), m = sz(u); vi ans(n,0);
	for(int i = 0; i < m; i++) adj[u[i]].pb(v[i]);
	for(int i = 0; i < n; i++) sort(all(adj[i]));
 	for(int i = 0; i < n; i++){
		int x = i;
		while(1){
			if(sz(adj[x])==1){
				if(adj[x][0]==x){ ans[i]=r[x]; break; }
				else x = adj[x][0];
			}
			else{
				if(r[x]){
					if(a[x]) { ans[i]=1; break; }
					else x = adj[x][1];
				}
				else{
					if(!a[x]) {ans[i]=0; break; }
					else x = adj[x][1];
				}
			}
		}
	}
	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...