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 <utility>
using namespace std;
#define pb push_back
pair<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){
vector<int> a, b;
for(int i = 0; i < M; ++i) if(U[i] == 0) a.pb(i);
for(int i = 0; i < M; ++i) if(U[i] == 1) b.pb(i);
if(a.size() >= 2 && b.size() >= 1){
return {1, {a[0], b[0], a[1], a[0], b[0], a[1]}};
}
assert(0);
return {0, {}};
}
# | 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... |