Submission #1024774

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024774		Issa	수천개의 섬 (IOI22_islands)	C++17	1.75 / 100	21 ms	10580 KiB

islands

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2e5 + 100;

int n;
vector<pii> g[maxn];
int used[maxn];

bool dfs(int v, int i){
    used[v] = 1;
    for(auto [to, in]: g[v]){
        if(in == i) continue;
        if(used[to]) return 1;
        if(dfs(to, in)) return 1;
    } return 0;
}

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V){
    n = N;
    for(int i = 0; i < M; i++){
        int a = U[i] + 1, b = V[i] + 1;
        g[a].push_back({b, i / 2});
    }
    return dfs(1, -1);
}

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