Submission #157221

# Submission time Handle Problem Language Result Execution time Memory
157221 2019-10-10T07:21:54 Z AKaan37 The Big Prize (IOI17_prize) C++17
20 / 100
2 ms 508 KB
#include "prize.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;

int find_best(int n) {
	int bas=0;
	int son=n-1;
	while(bas<=son){
		vector<int> res=ask(ort);
		if(res[0]+res[1]==0)return ort;
		if(res[0]==1)son=ort-1;
		else bas=ort+1;
	}
	return son;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 392 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 276 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 324 KB Output is correct
6 Correct 2 ms 300 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 392 KB Output is correct
11 Incorrect 2 ms 248 KB answer is not correct
12 Halted 0 ms 0 KB -