Submission #1113799

#TimeUsernameProblemLanguageResultExecution timeMemory
1113799salmonIsland Hopping (JOI24_island)C++17
100 / 100
19 ms608 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L) {
    bool done[400];

    for(int i = 0; i <= N; i++){
        done[i] = false;
    }

    vector<int> v;
    int inv[400];

    inv[1] = -1;
    for(int i = 1; i < N; i++){
        v.push_back(query(1,i));
        inv[v[i - 1]] = i - 1;
    }

    for(int i = 0; i < N - 1; i++){
        if(done[i]) continue;

        int cont = 1;
        while(true){
            int num = query(v[i],cont);

            if(inv[num] < i){
                answer(num,v[i]);
                break;
            }
            else{
                answer(num,v[i]);
                done[inv[num]] = true;
            }

            cont++;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...