# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034526 | irmuun | Thousands Islands (IOI22_islands) | C++17 | 0 ms | 0 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>
#include "islands.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
const int maxn=2e5+5;
int n,m;
set<pair<int,int>>adj[maxn];
vector<int>ans,r;
bool solve(int x,int p){
if(adj[x].size()==0) return false;
if(adj[x].size()==1){
auto [y,sail]=*adj[x].begin();
adj[x].erase(adj[x].begin());
ans.pb(sail);
r.pb(sail);
return solve(y);
}
else{
auto [y,sail]=*adj[x].begin();
adj[x].erase(adj[x].begin());
auto [z,sail2]=*adj[x].begin();
adj[x].erase(adj[x].begin());
ans.pb(sail);
ans.pb(sail^1);
ans.pb(sail2);
ans.pb(sail2^1);
ans.pb(sail^1);
ans.pb(sail);
ans.pb(sail2^1);
ans.pb(sail2);
return true;
}
}