# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125234 | StefanSebez | Thousands Islands (IOI22_islands) | C++20 | 109 ms | 17396 KiB |
#include "islands.h"
#include<bits/stdc++.h>
#include <variant>
#include <vector>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int N=1e5+50;
vector<int>E[N];
int U[2*N],V[2*N];
bool was[N];int par[N];
//vector<int>ans;bool imares;
int nekicvor=-1;
void DFS(int u){
was[u]=true;
if(E[u].size()>=3||(u==0&&E[u].size()>=2)) {nekicvor=u;return;}
for(auto i:E[u]){
if(!was[V[i]]) par[V[i]]=u,DFS(V[i]);
}
/*vector<int>nesto;
for(auto i:E[u]){
if(!was[i]) nesto.pb(i);
}
if(nesto.size()>=2){
int ind[4];
ind[0]=nesto[0];
if(ind[0]%2==0) ind[1]=ind[0]+1;
# | 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... |