Submission #1233995

#TimeUsernameProblemLanguageResultExecution timeMemory
1233995trimkusThousands Islands (IOI22_islands)C++20
3.50 / 100
19 ms3396 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) { vector<int> deg(N); int cn1 = -1, cn2 = -1, cn3 = -1; for (int i = 0; i < M; ++i) { deg[U[i]] += 1; if (U[i] == 0 && cn1 == -1) cn1 = i; else if (U[i] == 0 && cn2 == -1) cn2 = i; else if (U[1] == 1 && cn3 == -1) cn3 = i; } if (deg[0] >= 2 && deg[1] >= 1) { return vector<int>({cn1, cn3, cn2, cn1, cn3, cn2}); } 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...