oj.uz

Submission #117282

# Submission time Handle Problem Language Result Execution time Memory
117282 2019-06-15T12:43:00 Z WongHokFong_cpp The Big Prize (IOI17_prize) C++14
20 / 100
 63 ms 512 KB 
#include <iostream>
#include <cstdio>
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <algorithm>
#include "prize.h" 
#include <vector>
using namespace std;
vector<int> a;
int find_best(int n)
{
	int l=0,r=n-1;
	int mid;
	while(0==0)
	{
		mid=(r+l)/2;
		a=ask(mid);
		if(a[0]+a[1]==0) return mid;
		if(a[0]==1) r=mid-1;
		else l=mid+1;
	}
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 320 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 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 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Incorrect 63 ms 384 KB Incorrect
12 Halted 0 ms 0 KB -