# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825775 | top34051 | Thousands Islands (IOI22_islands) | C++17 | 4 ms | 5120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "islands.h"
#include <variant>
#include <vector>
const int maxn = 1e5 + 5;
std::vector<std::pair<int, std::pair<int, int>>> way[maxn];
std::vector<int> path, ans;
int goal;
bool subtask3_completed, vis[maxn];
void subtask3(int u, int last) {
vis[u] = true;
if (u == goal) {
std::vector<int> has;
for (auto &[v, idx] : way[u]) {
int i = idx.first, j = idx.second;
if (i == last || j == last) continue;
has.push_back(i);
has.push_back(j);
if ((int)has.size() == 4) break;
}
ans = path;
ans.push_back(has[0]);
ans.push_back(has[1]);
ans.push_back(has[2]);
ans.push_back(has[3]);
ans.push_back(has[1]);
ans.push_back(has[0]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |