Submission #1024750

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024750		Wansur	Thousands Islands (IOI22_islands)	C++17	0 / 100	36 ms	21416 KiB

islands

#include <bits/stdc++.h>
#include <variant>
#define f first
#define s second
#define ent '\n'

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 12;
const int mod = 1e9 + 2022;

map<int, int> a[maxn];
vector<int> g[maxn];
int used[maxn];
vector<int> cyc, ord;
int n, m;

void dfs(int v){
    used[v] = 1;
    for(int to:g[v]){
        if(to == 0){
            cyc = ord;
            cyc.push_back(a[v][to]);
        }
        if(!used[to]){
            ord.push_back(a[v][to]);
            dfs(to);
            ord.pop_back();
        }
    }
}

variant<bool, vector<int>> find_journey(int N, int M, vector<int> u, vector<int> v){
    n = N, m = M;
    for(int i=0;i<m;i+=2){
        a[u[i]][v[i]] = i;
        g[u[i]].push_back(v[i]);
    }
    dfs(0);
    if(cyc.size() == 0){
        return false;
    }
    return cyc;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45