# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730415 | caganyanmaz | Thousands Islands (IOI22_islands) | C++17 | 41 ms | 6144 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 <bits/stdc++.h>
#define pb push_back
#define pp pop_back
using namespace std;
vector<int> path;
vector<bool> visited;
vector<vector<int>> g;
vector<array<int, 2>> edges;
vector<int> result;
void add(int next_node, int node)
{
int next_edge;
for (next_edge = 0; next_edge < g[next_node].size() && edges[g[next_node][next_edge]][1] != node; next_edge++);
assert(next_edge < g[next_node].size());
result.pb(g[next_node][next_edge]);
reverse(g[next_node].begin(), g[next_node].end());
}
bool dfs(int node)
{
if (g[node].size() > 2 || (g[node].size() > 1 && node == 0))
{
for (int i : path)
result.pb(i);
if (node != 0)
for (int i = g[node].size()-1; i >= 0; i--)
if (edges[g[node][i]][1] == edges[path.back()][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... |