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>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18; int mod = 119<<23|1;
vector<int> who_wins(vector<int> t, vector<int> ch, vector<int> u, vector<int> v){
int n = ssize(t);
vector<int> g(n);
for(int i = 0; i < ssize(u); ++i) if(v[i] == u[i]) g[u[i]] |= 1;
else g[u[i]] |= 2;
vector<int> ret(n, 0);
for(int i = 0; i < n; ++i){
for(int j = i; j < n; ++j){
if(t[j]){
if(g[j] & 1 && ch[j]){ ret[i] = 1; break; }
else if(~g[j] & 2) break;
}
else{
if(g[j] & 1 && !ch[j]) break;
else if(~g[j] & 2){ ret[i] = 1; break; }
}
}
}
return ret;
}
# | 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... |