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;
pair<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){
int a = 0, b = 0;
for(int i = 0; i < M; ++i) if(U[i] == 0) a++;
for(int i = 0; i < M; ++i) if(U[i] == 1) b++;
if(a >= 2 && b >= 1){
return {1, {0, 1, 0, 1, 0, 1, 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... |