Submission #627776

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
627776	2022-08-12T22:52:50 Z	hy_1	The Big Prize (IOI17_prize)	C++14	20 / 100	57 ms	348 KB

prize

#include "prize.h"

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>

using namespace std;


int find_best(int n) {
	int l = 0;
	int r = n-1;
	while(l <= r){
		int mid = (l+r)/2;
		vector<int> res = ask(mid);
		if(res[0] + res[1] == 0){
			return mid;
		}else if(res[0] != 0) r = mid - 1; 
		else l = mid + 1;
	}
}

Compilation message

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

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	0 ms	296 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	292 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Incorrect	57 ms	308 KB	Incorrect
12	Halted	0 ms	0 KB	-