oj.uz

Submission #434235

# Submission time Handle Problem Language Result Execution time Memory
434235 2021-06-20T18:58:15 Z AmineTrabelsi The Big Prize (IOI17_prize) C++14
20 / 100
 1 ms 284 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	// 20 points:
	// 1 diamond
	int low = 0,high = n-1;
	int ans = -1;
	while(low != high){
		int mid = (low+high)/2;
		vector<int> q = ask(mid);
		if(q[0] == 1){
			high = mid-1;
		}else if(q[1] == 1){
			low = mid+1;
		}else{
			ans = mid;
			break;
		}
	}
	return (ans == -1 ? low : ans);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 260 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 284 KB Output is correct
10 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 280 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 280 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Incorrect 1 ms 260 KB answer is not correct
12 Halted 0 ms 0 KB -