Submission #831406

#TimeUsernameProblemLanguageResultExecution timeMemory
831406NeroZeinThousands Islands (IOI22_islands)C++17
5 / 100
24 ms4432 KiB
#include "islands.h" #include <variant> #include <vector> #include <bits/stdc++.h> using namespace std; std::variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { vector<int> v[2]; for (int i = 0; i < M; ++i) { v[U[i]].push_back(i); } if (v[1].empty() || v[0].size() <= 1) return false; int x = v[0][0], y = v[0][1], z = v[1][0]; return vector<int>({x, z, y, x, z, y}); }
#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...