제출 #1123367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123367		Sharky	Island Hopping (JOI24_island)	C++17	100 / 100	4 ms	432 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<int> mx(N+1, 0);
    vector<int> lst(N+1, 0);
    vector<int> cnt(N+1, 0);
    vector<int> vt[N+1];
    vector<bool> ok(N+1, 1);
    for (int id = 1; id <= N; id++) {
        for (int i = 1; i <= N; i++) {
            if (!ok[i]) continue;
            while (mx[i] < id && cnt[i] < N - 1) {
                cnt[i]++;
                int v = query(i, cnt[i]);
                if (v > i || v < lst[i]) {
                    ok[i] = 0;
                    break;
                }
                lst[i] = v;
                mx[i] = v;
                vt[v].push_back(i);
            }
        }
        for (auto& x : vt[id]) {
            if (find(id) != find(x)) {
                merge(id, x);
                answer(id, x);
            } else ok[x] = 0;
        }
    }
}

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