# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061629 | jamjanek | Thousands Islands (IOI22_islands) | C++17 | 21 ms | 8656 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 <variant>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int odw[100010];
vector<pair<int, int>>graf[100010];
vector<int>ans;
vector<int>stos;
void dfs(int x, int kra){
if(graf[x].size()>2){
int pom = graf[x][0].second, pom1 = graf[x][1].second;
if(pom/2==kra/2)
pom = graf[x][2].second;
if(pom1/2==kra/2)
pom1 = graf[x][2].second;
ans = stos;
vector<int>POM = {pom, pom^1, pom1, pom1^1, pom^1, pom, pom1^1, pom1};
for(auto j: POM)
ans.push_back(j);
while(stos.size()){
ans.push_back(stos.back()^1);
stos.pop_back();
}
return;
}
for(auto j: graf[x]){
if(kra/2!=j.second/2){
# | 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... |