Submission #1123364

#	Time	Username	Problem	Language	Result	Execution time	Memory
1123364		Sharky	Island Hopping (JOI24_island)	C++17	65 / 100	4 ms	424 KiB

island

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

int p[301];

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

void merge(int u, int v) {
    p[find(v)] = find(u);
}

void solve(int N, int L) {
    for (int i = 1; i <= N; i++) p[i] = i;
    vector<pair<int, int>> e;
    for (int i = 1; i <= N; i++) {
        int lst = 0;
        for (int it = 1; it < N; it++) {
            int v = query(i, it);
            if (v > i) break;
            if (v < lst) break;
            lst = v;
            e.push_back({i, v});
        }
    }
    sort(e.begin(), e.end(), [] (auto x, auto y) {
        if (x.second == y.second) return x.first < y.first;
        return x.second < y.second;
    });
    for (auto& [x, y] : e) if (find(x) != find(y)) {
        merge(x, y);
        answer(x, y);
    }
}

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