Submission #1234079

#TimeUsernameProblemLanguageResultExecution timeMemory
1234079trimkusThousands Islands (IOI22_islands)C++20
5 / 100
17 ms3144 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) { if (N == 2) return false; int cn1, cn2, cn3, cn4; for (int i = 0; i < M; ++i) { if (U[i] == 0 && V[i] == 1) cn1 = i; if (U[i] == 1 && V[i] == 0) cn2 = i; if (U[i] == 0 && V[i] == 2) cn3 = i; if (U[i] == 2 && V[i] == 0) cn4 = i; } return vector<int>({cn1, cn2, cn3, cn4, cn2, cn1, cn4, cn3}); }
#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...