제출 #1192763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192763		joelgun14	Island Hopping (JOI24_island)	C++20	100 / 100	2 ms	408 KiB

island

#include "island.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L) {
  bool have_par[N + 1];
  memset(have_par, 0, sizeof(have_par));
  int dist[N + 1];
  int order[N + 1];
  dist[1] = 0;
  for (int i = 1; i < N; ++i) {
    int nx = query(1, i);
    dist[nx] = i;
    order[i] = nx;
  }
  for (int i = 1; i < N; ++i) {
    int cur = order[i];
    if (have_par[cur]) {
      continue;
    }
    for (int j = 1; j < N; ++j) {
      int nx = query(cur, j);
      if (dist[nx] < dist[cur]) {
        // found par, stop
        answer(nx, cur);
        have_par[cur] = 1;
        break;
      } else {
        // we are finding a child, so the child doesn't have to find par :D
        answer(nx, cur);
        have_par[nx] = 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