Submission #1228787

#TimeUsernameProblemLanguageResultExecution timeMemory
1228787ericl23302Thousands Islands (IOI22_islands)C++20
5 / 100
18 ms4464 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<vector<int>> boats(2); for (int i = 0; i < M; ++i) boats[U[i]].push_back(i); if (boats[0].size() < 2 || boats[1].size() < 1) return false; return vector<int>{boats[0][0], boats[1][0], boats[0][1], boats[0][0], boats[1][0], boats[0][1]}; }
#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...