Submission #1240687

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

using namespace std;

const int maxn = 1e5 + 10;

int desno[maxn];
int sebe[maxn];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
	int m = v.size();
	
	for(int i = 0; i < m; i++){
		if(u[i] == v[i]) sebe[u[i]] = 1;
		if(v[i] == u[i] + 1) desno[u[i]] = 1;
	}

	vector <int> ans(n, 1);

	bool ok = 0;

	for(int i = n - 1; i >= 0; i--){
		if(!desno[i]) ok = 0;

		if(sebe[i] && a[i] == 1 && r[i] == 1) ok = 1;

		if(sebe[i] && a[i] == 0 && r[i] == 0) ok = 0;

		ans[i] = ok;
	}

	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...