Submission #978238

#	Time	Username	Problem	Language	Result	Execution time	Memory
978238		model_code	Island Hopping (JOI24_island)	C++17	100 / 100	6 ms	600 KiB

island

#include "island.h"

#include <vector>
#include <algorithm>
using namespace std;

void solve(int N, int L){
    vector<int> dist(N, 0), near(N, 0), ok(N, 0);
    dist[0] = 0;
    near[0] = 0;
    for(int i = 1; i < N; i++){
        int a = query(1, i) - 1;
        dist[a] = i;
        near[i] = a;
    }

    for(int t = 1; t < N; t++){
        int i = near[t];
        if(ok[i]){
            continue;
        }
        for(int j = 1; j < N; j++){
            int a = query(i + 1, j) - 1;
            if(dist[a] < dist[i]){
                answer(i + 1, a + 1);
                break;
            }
            else{
                answer(i + 1, a + 1);
                ok[a] = 1;
            }
        }
    }
}

• 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