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>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
variant<bool,vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v){
bool ban=false;
int ban1=0;
int a=-1,b=-1,c=-1;
for(int i=0; i<m; i++){
if(u[i]==0){
ban1++;
if(a==-1){
a=i;
}else{
b=i;
}
}else{
ban=true;
c=i;
}
}
vector<int> x(6);
if(ban==true && ban1>1){
x={a,c,b,a,c,b};
return x;
}else{
return false;
}
}
# | 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... |