Submission #1166877

#TimeUsernameProblemLanguageResultExecution timeMemory
1166877PoonYaPatIsland Hopping (JOI24_island)C++20
100 / 100
2 ms408 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L) {
  bool have[305];
  memset(have,0,sizeof(have));
  have[1]=true;
  for (int i=1; i<N; ++i) {
    int x=query(1,i);
    if (have[x]) continue;
    have[x]=true;
    for (int j=1; j<N; ++j) {
      int y=query(x,j);
      answer(x,y);
      if (have[y]) break;
      have[y]=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...