This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Subtask 1
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 10;
int n, m;
bool loop[maxn], go[maxn];
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = a.size(), m = u.size();
for (int i = 0; i < m; i++){
if (v[i] == u[i])
loop[u[i]] = true;
else
go[u[i]] = true;
}
vector<int> dp(n);
for (int i = n-1; i >= 0; i--){
if (loop[i] == 0){
dp[i] = dp[i+1];
continue;
}
if (go[i] == 0){
dp[i] = r[i];
continue;
}
if (a[i] == 0){
if (r[i])
dp[i] = dp[i+1];
else
dp[i] = 0;
}
else{
if (r[i])
dp[i] = 1;
else
dp[i] = dp[i+1];
}
}
return dp;
}
# | 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... |