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"
#define ent '\n'
#define f first
#define s second
//#define int long long
using namespace std;
typedef long long ll;
const int maxn = 5e3 + 12;
const int mod = 1e9 + 7;
vector<int> g[maxn], rg[maxn];
int in[maxn], out[maxn];
bool won[maxn];
int n, m;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){
n = a.size(), m = U.size();
vector<int> ans(n);
for(int i=0;i<m;i++){
g[U[i]].push_back(V[i]);
rg[V[i]].push_back(U[i]);
}
for(int v=0;v<n;v++){
if(r[v] == 0){
continue;
}
for(int i=0;i<n;i++){
out[i] = g[i].size();
won[i] = 0;
}
won[v] = 1;
queue<int> q;
q.push(v);
while(q.size()){
int v = q.front();
q.pop();
for(int to:rg[v]){
if(a[to] && !won[to]){
won[to] = 1;
q.push(to);
}
if(!a[to]){
out[to]--;
if(out[to] == 0){
won[to] = 1;
q.push(to);
}
}
}
}
bool ok = 0;
for(int to:g[v]){
if(won[to]){
ok = 1;
}
}
if(ok){
for(int i=0;i<n;i++){
if(won[i]){
ans[i] = 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... |