Submission #1191949

#	Time	Username	Problem	Language	Result	Execution time	Memory
1191949		AlgorithmWarrior	Island Hopping (JOI24_island)	C++20	100 / 100	2 ms	396 KiB

island

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <random>
#include <utility>
#include <vector>
#include "island.h"

int const MAX=305;
int aproape[MAX];
int notif[MAX];

void solve(int N, int L) {
    int i;
    for(i=1;i<=N;++i){
        aproape[i]=query(i,1);
        notif[i]=0;
    }
    for(i=N;i>1;--i){
        int vec=aproape[i];
        int nrvec=1;
        while(1){
            if(vec>i)
                break;
            if(notif[vec]==i)
                break;
            answer(i,vec);
            notif[aproape[vec]]=i;
            ++nrvec;
            if(nrvec==N)
                break;
            vec=query(i,nrvec);
        }
    }
}

• 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