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;
pair<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v){
bool ban=false;
int ban1=0;
for(int i=0; i<m; i++){
if(u[i]==0){
ban1++;
}else{
ban=true;
}
}
vector<int> a(7);
if(ban==false && ban1>1){
a={0,1,0,1,0,1,0};
return {true,a};
}else{
return {false,a};
}
}
# | 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... |