Submission #1204119

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204119		LucaIlie	Island Hopping (JOI24_island)	C++20	100 / 100	3 ms	412 KiB

island

#include "island.h"
#include <bits/stdc++.h>

const int MAX_N = 300;
int depth[MAX_N + 1];
bool isCand[MAX_N + 1];
int parent[MAX_N + 1];

using namespace std;

void solve(int n, int l) {
    int root = 1;

    depth[root] = 0;
    queue<int> cand;
    cand.push(root);
    isCand[root] = true;
    for (int i = 1; i <= n - 1; i++) {
        int v = query(root, i);
        int p = parent[v];
        if (p == 0) {
            int j = 1;
            p = query(v, j);
            while (!isCand[p]) {
                parent[p] = v;
                j++;
                p = query(v, j);
            }
        }

        answer(p, v);
        depth[v] = depth[p] + 1;
        cand.push(v);
        isCand[v] = true;
        while (depth[cand.front()] + 1 < depth[v]) {
            isCand[cand.front()] = false;
            cand.pop();
        }
    }
}

• 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