This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "train.h"
template <class T>
using Vec = std::vector<T>;
Vec<int> who_wins(Vec<int> a, Vec<int> r, Vec<int> u, Vec<int> v) {
const int n = (int) a.size();
const int m = (int) u.size();
{
bool sub1 = true;
Vec<bool> loop(n);
Vec<bool> right(n);
for (int i = 0; i < m; ++i) {
if (u[i] == v[i]) {
loop[u[i]] = true;
}
else if (u[i] + 1 == v[i]) {
right[u[i]] = true;
}
else {
sub1 = false;
break;
}
}
if (sub1) {
Vec<int> ret(n);
for (int i = n - 1; i >= 0; --i) {
if (a[i]) {
ret[i] = 0;
if (r[i] && loop[i]) {
ret[i] = 1;
}
if (right[i] && ret[i + 1]) {
ret[i] = 1;
}
}
else {
ret[i] = 1;
if (!r[i] && loop[i]) {
ret[i] = 0;
}
if (right[i] && !ret[i + 1]) {
ret[i] = 0;
}
}
}
return ret;
}
}
return {};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |