#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |