Submission #797672

#TimeUsernameProblemLanguageResultExecution timeMemory
797672Joshi503Thousands Islands (IOI22_islands)C++17
5 / 100
26 ms5132 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> using namespace std; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){ vector<int> ida, regreso; for(int i = 0; i < M; i++){ if(U[i] == 0 && V[i] == 1) ida.push_back(i); else regreso.push_back(i); } vector<int> x; if((int)ida.size() >= 2 && (int)(regreso.size())){ x = {ida[0], regreso[0], ida[1], ida[0], regreso[0], ida[1]}; return x; } return false; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...