# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721960 | pere_gil | Thousands Islands (IOI22_islands) | C++17 | 1166 ms | 2097152 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;
#define ii pair<int,int>
const int MAX_N=1e5+5;
vector<ii> adj[MAX_N];
vector<bool> vis(MAX_N,false);
vector<int> path,res;
int piv=-1;
void dfs(int u){
if(piv!=-1) return;
vis[u]=false;
if(adj[u].size()>=2 && u){
piv=u;
int a=adj[u][0].second,b=adj[u][1].second;
vector<int> aux={a,a+1,b,b+1,a+1,a,b+1,b};
res=path;
for(int i: aux) res.push_back(i);
for(int i=path.size()-1;i>=0;i--) res.push_back(path[i]);
return;
}
for(auto v: adj[u]){
if(vis[v.first]) continue;
# | 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... |