제출 #1024723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024723		mansur	수천개의 섬 (IOI22_islands)	C++17	6.75 / 100	31 ms	15960 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
#include <variant>

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int) s.size()
#define s second 
#define f first 

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int N = 3e5;

vector<pii> g[N], pr(N);
vector<int> was(N), s;
int is = 0;

void dfs(int u, int x) {
    was[u] = 1;
    for (auto [to, id]: g[u]) {
        if (id == x) continue;
        if (!was[to]) {
            pr[to] = {u, id};
            dfs(to, id ^ 1);
            if (is) return;
        }else if (!to) {
            is = 1; 
            return;
            s.push_back(id);
            while (u) {
                s.push_back(pr[u].s);
                u = pr[u].f;
            }
            return;
        }
    }
}

variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v) {
    for (int i = 0; i < m; i++) g[u[i]].push_back({v[i], i});
    if (n == 2) {
        if (sz(g[0]) > 1 && sz(g[1])) {
            vector<int> ans = {g[0][0].s, g[1][0].s, g[0][1].s, g[0][0].s, g[1][0].s, g[0][1].s};
            return ans;
        }
        return false;
    }
    if (sz(g[0]) > 1) return true;
    if (sz(g[0]) == 1) return true;
    return false;
    int a[n][n];
    for (int i = 0; i < n; i++) {
        for (auto [to, id]: g[i]) a[i][to] = id;
    }
    vector<int> ans = {a[0][1], a[1][2], a[2][0], a[0][2], a[2][1], a[1][0], a[2][0], a[1][2], a[0][1], a[1][0], a[2][1], a[0][2]};
    return ans;
}

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