Submission #1222020

#TimeUsernameProblemLanguageResultExecution timeMemory
1222020totoroThousands Islands (IOI22_islands)C++20
6.75 / 100
18 ms4456 KiB
#include "islands.h" #include <variant> #include <vector> std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { std::vector<std::vector<int>> canoesfor(N); for (int i = 0; i < M; ++i) { canoesfor[U[i]].push_back(i); } if (canoesfor[0].size() < 2 || canoesfor[1].size() < 1) { return false; } int a, b, x; a = canoesfor[0][0]; b = canoesfor[0][1]; x = canoesfor[1][0]; return std::vector<int>{a, x, b, a, x, b}; }
#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...