Submission #1190552

#TimeUsernameProblemLanguageResultExecution timeMemory
1190552KK_1729Island Hopping (JOI24_island)C++20
100 / 100
2 ms408 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)

void solve(int N, int L) {
  vector<int> dist(N+1);
  vector<int> atdist(N+1);

  FOR(i,1,N){
    int a = query(1, i);
    dist[a] = i;
    
    atdist[i] = a;
  }
  vector<bool> done(N+1, false);
  FOR(i,1,N){
    int t = atdist[i];

    if (done[t]) continue;
    FOR(j,1,N){
      int d = query(t, j);
      if (dist[d] < dist[t]){
        answer(d, t);
        break;
      }else{
        answer(d, t);
        done[d] = true;
      }
    }
  }
}
#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...