This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
#include "train.h"
vector<int> adj[5001];
vector<int> who_wins(vector<int> aa, vector<int> bb,vector<int> uu,vector<int> vv) {
int n=aa.size();
int m=uu.size();
for(int i=0;i<m;i++){
adj[uu[i]].pb(vv[i]);
}
vector<int> ans;
for(int i=0;i<n;i++){
ans.pb(0);
for(int j=i;j<n;j++){
int st=0;
int st2=0;
for(auto ii:adj[j]){
if(ii==j){
st=1;
}
if(ii==j+1){
st2=1;
}
}
if(st==1){
if(st2==0){
if(bb[j]==1){
ans[i]=1;
}
else{
}
break;
}
if(aa[j]==0){
if(bb[j]==0){
break;
}
}
if(aa[j]==1 and bb[j]==1){
ans[i]=1;
break;
}
}
}
}
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... |