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 "train.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)5e3+10;
vi adj[mxN];
vi who_wins(vi a, vi r, vi u, vi v) {
int n = sz(a), m = sz(u); vi ans(n,0);
for(int i = 0; i < m; i++) adj[u[i]].pb(v[i]);
for(int i = 0; i < n; i++) sort(all(adj[i]));
for(int i = 0; i < n; i++){
if(adj[i][0]==i and r[i]){
if(a[i] or sz(adj[i])==1){ ans[i] = 1;
for(int j = i-1; j >= 0; j--){
if(sz(adj[j])==2 or adj[i][0]==i) break;
ans[j] = 1;
}
}
}
}
return ans;
}
# | 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... |