oj.uz

Submission #112172

# Submission time Handle Problem Language Result Execution time Memory
112172 2019-05-17T17:17:54 Z someone_aa The Big Prize (IOI17_prize) C++17
20 / 100
 4 ms 540 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int find_best(int n) {

	int li = 0;
	int ri = n - 1;

	while(li < ri) {
        int mid = (li + ri) / 2;

        vector<int>curr = ask(mid);

        if(curr[0] == curr[1]) return mid;

        if(curr[0] == 1) ri = mid - 1;
        else li = mid + 1;
	}

	return li;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 540 KB Output is correct
10 Correct 4 ms 432 KB Output is correct

Subtask #2
0 / 80.0

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