oj.uz

Submission #711760

# Submission time Handle Problem Language Result Execution time Memory
711760 2023-03-17T12:27:31 Z mseebacher The Big Prize (IOI17_prize) C++17
20 / 100
 1 ms 308 KB 
#include "prize.h"
#include<bits/stdc++.h>
 
using namespace std;
 
int find_best(int x){
	int l = 0;
	int r = x;
	int mid = 0;
	while(l+1<r){
		mid = (l+r)/2;
		vector<int> ans = ask(mid);
		if(ans[0]+ans[1] == 0) return mid;
		if(ans[0] == 1) r = mid;
		else l = mid;
	}
	return l;
	
}

Subtask #1
20.0 / 20.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 1 ms 300 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 292 KB Output is correct
9 Correct 1 ms 208 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 288 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 308 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 288 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 292 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 292 KB answer is not correct
12 Halted 0 ms 0 KB -