제출 #1276643

#제출 시각아이디문제언어결과실행 시간메모리
1276643jumpIsland Hopping (JOI24_island)C++20
0 / 100
2 ms400 KiB
#include <bits/stdc++.h>
void solve(int N, int L);
int query(int v, int k);
void answer(int x, int y);
void dfs(int current,int parent){
  int test = query(current,1);
  if(test==parent)return;
  if(test>current){
    return;
  }
  else{
    answer(current,test);
    dfs(test,current);
  }
}
void solve(int N, int L) {
  for (int i=N;i>=1;i--) {
    dfs(i,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...