# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037604 | 12345678 | Thousands Islands (IOI22_islands) | C++17 | 73 ms | 4940 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;
const int nx=1e3+5;
int ans, vs[nx];
vector<pair<int, int>> d[nx];
vector<int> l, res;
pair<int, int> pa[nx], pa2[nx];
void dfs(int u)
{
vs[u]=1;
l.push_back(u);
for (auto [v, idx]:d[u]) if (!vs[v]) pa[v]={u, idx}, dfs(v);
}
void dfs2(int u, int rt)
{
vs[u]=1;
for (auto [v, idx]:d[u])
{
if (!ans&&v==rt)
{
vector<int> tmp, path;
int cur=rt;
while (cur!=0) tmp.push_back(pa[cur].second), cur=pa[cur].first;
reverse(tmp.begin(), tmp.end());
# | 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... |