# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074500 | fv3 | Thousands Islands (IOI22_islands) | C++17 | 90 ms | 8732 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 <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>> adj;
vector<int> visited;
bool ok;
vector<int> find_cycle(int s, set<int>&path)
{
bool skip = false;
vector<int> cycle;
int i = s;
do
{
for (auto node : adj[i])
{
if (!path.count(node.first)) continue;
cycle.push_back(node.second);
i = node.first;
break;
}
}
while (i != s);
const int sz = cycle.size();
for (int i = 0; i < sz; i++)
cycle.push_back(cycle[i] ^ 1);
for (int i = 2 * sz - 1 ; i >= 0; i--)
cycle.push_back(cycle[i] ^ 1);
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... |