제출 #1238452

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

island

#include "island.h"

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

void solve(int N, int L) {
    vector<bool> found(N + 1);
    found[1] = true;

    // Iterate over the BFS starting at 1
    for (int k = 1; k < N; k ++) {
      int i = query(1, k); // N queries
      
      // found represents if the parent is already linked to the node
      // if yes we don't have anything to do
      if (found[i]) continue ;
      found[i] = true;

      // otherwise we search for the adjacent nodes, if it is the parent we stop
      // otherwise we set the next to found and answer that.
      // thus each link is visited once for N - 1 queries
      int off = 1;
      int nxt = -1;
      do {
        if (nxt != -1) found[nxt] = true;
        nxt = query(i, off ++);
        answer(i, nxt);
      } while (!found[nxt]);
    }
}

• 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