oj.uz

Submission #104414

# Submission time Handle Problem Language Result Execution time Memory
104414 2019-04-06T17:08:12 Z Badral The Big Prize (IOI17_prize) C++17
20 / 100
 4 ms 512 KB 
#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
int can(int k) {
	vector<int> cer = ask(k);
	if(cer[0] == 0 && cer[1] == 0) return 2;
	return (cer[0] == 0);
}

int find_best(int n) {
  int kk = -1;
	for(int i = n/2; i >= 1; i /= 2) {
		while(kk + i <= n) {
			int p = can(i+kk);
			if(p == 2) return (i + kk);
			if(p == 1) 
				kk += i;
			else break;
		}
	}
	return kk;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 304 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Incorrect 3 ms 384 KB answer is not correct
12 Halted 0 ms 0 KB -