oj.uz

Submission #1053938

# Submission time Handle Problem Language Result Execution time Memory
1053938 2024-08-11T21:44:52 Z aaaaaarroz The Big Prize (IOI17_prize) C++17
0 / 100
 53 ms 344 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int nn;
vector<int>ask(int i);
int worse=INT_MAX;
int lupdate=0;
int subir(){
	int l=lupdate,r=nn-1;
	while(l<r){
		int mid=(l+r+1)/2;
		vector<int>res=ask(mid);
		if((res[0]+res[1])<worse){
			lupdate=mid;
			worse=(res[0]+res[1]);
			return mid;
		}
		if(res[0]==0){
			l=mid;
		}
		else{
			r=mid-1;
		}
	}
}
int find_best(int n) {
	nn=n;
	int retorno=INT_MAX;
	while(worse!=0){
		retorno=subir();
	}
	return retorno;
}

Compilation message

prize.cpp: In function 'int subir()':
prize.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -