제출 #92284

#제출 시각아이디문제언어결과실행 시간메모리
92284igzipopa (BOI18_popa)C++17
0 / 100
10 ms376 KiB
#include <bits/stdc++.h>
#include "popa.h"
#define maxN 1005

using namespace std;

int solve(int n, int* l, int* d){
int i,root=0;
for(i=0;i<n;i++){
l[i]=d[i]=-1;
}
for(i=1;i<n;i++){
if(query(i-1,i,i-1,i-1)) d[i-1]=i;
else{
l[i]=root;
root=i;
}
}
return root;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...