Submission #1197135

#TimeUsernameProblemLanguageResultExecution timeMemory
1197135abczzIsland Hopping (JOI24_island)C++20
100 / 100
2 ms424 KiB
#include "island.h"
#include <iostream>
#include <vector>
#define ll long long

using namespace std;

vector <ll> V;
bool B[301];
ll P[301];
void solve(int N, int L) {
  for (int i=0; i<=N; ++i) P[i] = -1, B[i] = 0;
  V.clear();
  for (int i=1; i<=N-1; ++i) {
    V.push_back(query(1, i));
  }
  B[1] = 1;
  for (auto u : V) {
    B[u] = 1;
    if (P[u] != -1) continue;
    ll k = 0;
    while (++k) {
      auto z = query(u, k);
      if (B[z]) {
        P[u] = z;
        break;
      }
      else P[z] = u;
    }
  }
  for (int i=2; i<=N; ++i) {
    answer(i, P[i]);
  }
}
#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...