oj.uz

Submission #89997

# Submission time Handle Problem Language Result Execution time Memory
89997 2018-12-19T15:30:44 Z nikolapesic2802 The Big Prize (IOI17_prize) C++14
20 / 100
 2 ms 572 KB 
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
    int l=0,r=n-1;
    while(true)
    {
        int m=(l+r)>>1;
        vector<int> tr=ask(m);
        if(tr[0]==1)
        {
            r=m-1;
        }
        else
        {
            if(tr[1]==1)
            {
                l=m+1;
            }
            else
            {
                return m;
            }
        }
    }
	/*for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
	}
	return 0;*/
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 2 ms 552 KB Output is correct

Subtask #2
0 / 80.0

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