Submission #1037519

#TimeUsernameProblemLanguageResultExecution timeMemory
103751912345678Thousands Islands (IOI22_islands)C++17
0 / 100
1170 ms2097152 KiB
#include "islands.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;

int ans;
vector<int> d[nx];

void dfs(int u, int p)
{
    if (d[u].size()-(u!=p)>=2) ans=1;
    for (auto v:d[u]) if (v!=p) dfs(v, u);
}
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
    for (int i=0; i<M; i+=2) d[U[i]].push_back(V[i]), d[V[i]].push_back(U[i]);
    dfs(0, 0);
    if (ans) return vector<int> {};
    return false;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...