Submission #628506

#TimeUsernameProblemLanguageResultExecution timeMemory
628506c28dnv9q3Thousands Islands (IOI22_islands)C++17
6.75 / 100
34 ms4412 KiB
#include "islands.h" #include <variant> #include <vector> using namespace std; variant<bool, vector<int>> find_journey( int N, int M, vector<int> U, vector<int> V) { vector<int> c0, c1; for (int i = 0; i < M; i++) { if (U[i] == 0) c0.push_back(i); if (U[i] == 1) c1.push_back(i); } if (c0.size() >= 2 && c1.size() >= 1) { return vector<int>{ c0[0], c1[0], c0[1], c0[0], c1[0], c0[1], }; } 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...