Submission #992336

#	Time	Username	Problem	Language	Result	Execution time	Memory
992336		Sharky	Island Hopping (JOI24_island)	C++17	35 / 100	7 ms	856 KiB

island

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

vector<int> p, done;
vector<pair<int, int>> e;
bool ok[301][301];

int find(int u) {
    return p[u] == u ? u : p[u] = find(p[u]);
}

bool merge(int u, int v, int f = 1) {
    int pu = find(u), pv = find(v);
    if (pu == pv) return false;
    if (f) {
        p[pv] = pu;
        e.emplace_back(u, v);
    }
    return true;
}

void solve(int N, int L) {
    p.resize(N + 1);
    done.assign(N + 1, 0);
    for (int i = 1; i <= N; i++) p[i] = i;
    for (int iter = 1; iter <= N - 1; iter++) {
        vector<pair<int, int>> t;
        for (int i = 1; i <= N; i++) {
            if (done[i]) continue;
            int x = query(i, iter);
            // cout << i << " " << iter << " " << x << '\n';
            if (x > i || !merge(i, x, 0)) done[i] = 1;
            else t.push_back({i, x});
        }
        for (auto& [x, y] : t) merge(x, y);
    }
    for (auto& [x, y] : e) {
        if (ok[x][y]) continue;
        ok[x][y] = ok[y][x] = 1;
        // cout << x << ' ' << y << '\n';
        answer(x, y);
    }
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 7 / 7
• Subtask 4: 9 / 9
• Subtask 5: 13 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 22
• Subtask 8: 0 / 28