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 "islands.h"
using namespace std;
variant<bool,vector<int>> find_journey(int N,int M,vector<int> U,vector<int> V){
int Back=-1;
int Front_1=-1;
int Front_2=-1;
vector<int> S={0};
for(int i=0;i<M;i++){
if(!(Back+1) && U[i]==1) Back=i;
if(!(Front_1+1) && V[i]==1) Front_1=i;
if(!(Front_2+1) && V[i]==1) Front_2=i;
}
if(!(Back+1) || !(Front_1+1) || !(Front_2+1)) return false;
else return S;
}
# | 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... |