Submission #1370852

#	Time	Username	Problem	Language	Result	Execution time	Memory
1370852		Andrey	Thousands Islands (IOI22_islands)	C++17	0 / 100	1096 ms	10692 KiB

islands

#include "islands.h"
#include<bits/stdc++.h>
#include<variant>
using namespace std;

int n,m;
const int MAXN = 100010;
vector<pair<int,int>> haha[MAXN];

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> u, std::vector<int> v) {
    n = N;
    m = M;
    vector<int> br(n);
    for(int i = 0; i < m; i++) {
        haha[u[i]].push_back({v[i],i});
        haha[v[i]].push_back({u[i],i});
        br[v[i]]++;
    }
    int y = 0;
    vector<pair<int,int>> yo(n,{-1,-1});
    vector<bool> bruh(n,true);
    while(true) {
        vector<int> idk(0);
        vector<int> wow(0);
        idk.push_back(y);
        wow.push_back(y);
        for(int i = 0; i < idk.size(); i++) {
            int a = idk[i];
            for(pair<int,int> u: haha[a]) {
                int v = u.first;
                if(a == y) {
                    yo[v] = {u.second,-1};
                }
                else {
                    if(yo[a].second != -1) {
                        yo[v] = yo[a];
                    }
                    else if(yo[a].first != -1) {
                        if(yo[v].first == -1) {
                            yo[v] = {yo[a].first,-1};
                        }
                        else if(yo[v].second == -1) {
                            yo[v] = {yo[v].first,yo[v].second};
                        }
                    }
                }
                br[v]--;
                if(br[v] == 0) {
                    idk.push_back(v);
                }
                wow.push_back(v);
            }
        }
        int x = -1,p = -1;
        for(int v: wow) {
            if(br[v] > 0) {
                if(yo[v].second != -1) {
                    return true;
                }
                if(yo[v].first != -1) {
                    if(x == -1) {
                        x = yo[v].first;
                        p = v;
                    }
                    else {
                        return true;
                    }
                }
            }
        }
        for(int v: idk) {
            bruh[v] = false;
        }
        y = p;
    }
}

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