답안 #1053939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053939	2024-08-11T21:47:45 Z	aaaaaarroz	커다란 상품 (IOI17_prize)	C++17	20 / 100	44 ms	428 KB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int nn;
vector<int>ask(int i);
int worse=INT_MAX;
int subir(){
	int l=0,r=nn-1;
	while(l<r){
		int mid=(l+r+1)/2;
		vector<int>res=ask(mid);
		if((res[0]+res[1])<worse){
			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:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	428 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	428 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Incorrect	44 ms	344 KB	Incorrect
12	Halted	0 ms	0 KB	-