# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239585 | ctziapo | Xylophone (JOI18_xylophone) | C++14 | 112 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "xylophone.h"
#include<cmath>
#include<map>
static int A[5000];
using namespace std;
void solve(int N) {
int n=N;
int value = query(1, N);
int pf;
// cout<<" find first "<<endl;
//for(int i=1;i<=n;i++){
// int t=query(i,N);
// if(t!=n-1){
// pf=i-1;
// break;
// }
//}
int l=1;
int r=n;
while(l<r){
int mid = (l+r)/2;
int t=query(mid,n);
if(t==n-1){
l=mid+1;
}
else
r=mid-1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |