# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721981 | pere_gil | Thousands Islands (IOI22_islands) | C++17 | 43 ms | 9020 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;
int piv=-1;
vector<int> path,res;
vector<pair<int,ii>> adj[MAX_N];
vector<bool> vis(MAX_N,false);
void dfs(int u, int pa){
if(piv!=-1) return;
vis[u]=true;
if((!u && adj[u].size()>=2) || (u && adj[u].size()>=3)){
piv=u;
int a=-1,b=-1,c=-1,d=-1;
for(auto v: adj[u]){
if(v.first==pa) continue;
if(a==-1)
a=v.second.first,b=v.second.second;
else{
c=v.second.first,d=v.second.second;
break;
}
}
res=path;
# | 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... |