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 "islands.h"
#include <variant>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V)
{
vector<int>o,z;
for(int i=0;i<M;i++)
{
if(U[i])
o.pb(i);
else
z.pb(i);
}
if(o.size()<1 || z.size()<2)
return false;
vector<int>v={z[0],o[0],z[1],z[0],o[0],z[1]};
return v;
}
# | 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... |