Submission #1072977

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072977		beaconmc	Thousands Islands (IOI22_islands)	C++17	1.75 / 100	64 ms	16336 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

const ll maxn = 100005;
set<int> edges[maxn];
bool visited[maxn];

bool flag = 0;

void dfs(ll a, ll p){
    visited[a] = 1;
    for (auto&i : edges[a]){
        if (i==p) continue;
        if (visited[i]) flag = 1;
        else{
            visited[i] = 1;
            dfs(i, a);
        }
    }
}

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
    flag = 0;
    FOR(i,0,maxn) visited[i] = 0;
    FOR(i,0,maxn) edges[i].clear();

    FOR(i,0,M){
        edges[U[i]].insert(V[i]);
    }
    dfs(0, -1);

    if (flag==1) return true;
    else return false;

}

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