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 ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;int n,m;
vector<int>ans;
const int N=5090;
int vis[N];
vector<int>v[N];
int r[N];
int dfs(int x)
{
if(v[x][0]==x)
{
if(r[x])return 1;
return 0;
}
return dfs(v[x][0]);
}
vector<int> who_wins(vector<int> A,vector<int> R,vector<int> u,vector<int> uu) {
n=R.size();m=u.size();
for(int i=0;i<n;i++)
r[i]=R[i];
for(int i=0;i<m;i++)
v[u[i]].pb(uu[i]);
for(int i=0;i<n;i++)
{
memset(vis,0,sizeof vis);
ans.pb(dfs(i));
}
return ans;
}
/*
4 4
0 0 0 0
0 0 0 1
0 1
1 2
2 2
3 3
*/
# | 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... |