Submission #1196980

#TimeUsernameProblemLanguageResultExecution timeMemory
1196980alterioToy Train (IOI17_train)C++20
5 / 100
17 ms25160 KiB
#include <bits/stdc++.h>
#include "train.h"

using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size(), m = u.size();
	bool edg[n + 10][n + 10];
	memset(edg, 0, sizeof(edg));
	for (int i = 0; i < m; i++) edg[u[i]][v[i]] = 1;
	vector<int> res(n, 0);
	for (int i = n - 1; i >= 0; i--) {
		if (a[i] && r[i] && edg[i][i]) {
			res[i] = 1; 
			continue;
		}
		if (!a[i] && !r[i] && edg[i][i]) {
			res[i] = 0; 
			continue;
		}
		if (edg[i][i + 1]) res[i] = res[i + 1];
		else res[i] = r[i];
	}
	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...