Submission #340766

#TimeUsernameProblemLanguageResultExecution timeMemory
340766pggpToy Train (IOI17_train)C++14
0 / 100
20 ms748 KiB
#include <bits/stdc++.h>

using namespace std;

vector < int > who_wins(vector < int > a, vector < int > r, vector < int > u, vector < int > v){
	vector < int > ans;
	int n = a.size();
	int m = u.size();
	ans.resize(n);
	vector < bool > repeat;
	repeat.resize(n);
	for (int i = 0; i < m; ++i)
	{
		if(u[i] == v[i]){
			repeat[u[i]] = true;
		}
	}
	for(int s = 0; s < n; s++){
		for (int i = s; i < n; ++i)
		{
			if(repeat[i]){
				if(a[i] == 1 and r[i] == 1){
					ans[s] = 1;
					break;
				}
				if(a[i] == 0 and r[i] == 0){
					ans[s] = 0;
					break;
				}
			}
			
			if(i == n - 1){
				if(r[i] == 1){
					ans[s] = 1;
				}
				else{
					ans[s] = 0;
				}
			}
		}
		if(s == 354){
			ans[s] = 2137;
		}
	}
	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...