제출 #282898

#제출 시각아이디문제언어결과실행 시간메모리
282898mosiashvililukaXylophone (JOI18_xylophone)C++14
0 / 100
1 ms256 KiB
#include<bits/stdc++.h> #include "xylophone.h" using namespace std; int a,b,c,d,e,i,j,ii,jj,zx,xc; void solve(int n){ for(i=2; i<=n; i++){ c=query(i,n); if(c!=n-1){ zx=i-1; break; } } answer(zx,1); for(i=zx+1; i<=n; i++){ c=query(zx,i); answer(i,c+1); } for(i=zx-1; i>=1; i--){ c=query(i,zx); answer(i,c+1); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...