oj.uz

Submission #43144

# Submission time Handle Problem Language Result Execution time Memory
43144 2018-03-09T10:31:08 Z RayaBurong25_1 The Big Prize (IOI17_prize) C++14
20 / 100
 16 ms 4364 KB 
#include "prize.h"
#include <stdio.h>
#include <vector>
#include <algorithm>
int L[200005], R[200005];
int V[200005];
int min(int a, int b)
{
	return (a < b)?a:b;
}
int max(int a, int b)
{
	return (a > b)?a:b;
}
int find_best(int n) {
	int i;
	for (i = 0; i < n; i++)
		L[i] = -1;
	int mn, md, mx;
	//first sig
	std::vector<int> r;
	r = ask(0);
	L[0] = r[0];
	R[0] = r[1];
	if (R[0] == 0)
		return 0;
	r = ask(n - 1);
	L[n - 1] = r[0];
	R[n - 1] = r[1];
	if (L[n - 1] == 0)
		return n - 1;
	int sigl = 0, sigr = n - 1;
	while (sigl < sigr)
	{
		for (i = 0; i < 3; i++)
		{
		mn = sigl;
		mx = sigr;
		while (mx != mn)
		{
			if (mx - mn == 1)
			{
				sigr = mn;
				break;
			}
			md = (mn + mx)/2;
			if (L[md] == -1)
			{
				r = ask(md);
				L[md] = r[0];
				R[md] = r[1];
			}
			if (L[md] == 0 && R[md] == 0)
				return md;
			if (L[md] == L[sigr] && R[md] == R[sigr])
				mx = md;
			else
				mn = md;
		}
		if (L[sigr] == -1)
		{
			r = ask(sigr);
			L[sigr] = r[0];
			R[sigr] = r[1];
		}
		if (L[sigr] == 0 && R[sigr] == 0)
			return sigr;
		}
		// printf("sigl %d sigr %d\n", sigl, sigr);
		for (i = 0; i < 3; i++)
		{
		mn = sigl;
		mx = sigr;
		while (mx != mn)
		{
			if (mx - mn == 1)
			{
				sigl = mx;
				break;
			}
			md = (mn + mx)/2;
			if (L[md] == -1)
			{
				r = ask(md);
				L[md] = r[0];
				R[md] = r[1];
			}
			if (L[md] == 0 && R[md] == 0)
				return md;
			if (L[md] == L[sigl] && R[md] == R[sigl])
				mn = md;
			else
				mx = md;
		}
		if (L[sigl] == -1)
		{
			r = ask(sigl);
			L[sigl] = r[0];
			R[sigl] = r[1];
		}
		if (L[sigl] == 0 && R[sigl] == 0)
			return sigl;
		}
	}
	if (sigl == sigr)
		return sigl;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:107:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4364 KB Output is correct
2 Correct 2 ms 4364 KB Output is correct
3 Correct 1 ms 4364 KB Output is correct
4 Correct 1 ms 4364 KB Output is correct
5 Correct 1 ms 4364 KB Output is correct
6 Correct 1 ms 4364 KB Output is correct
7 Correct 1 ms 4364 KB Output is correct
8 Correct 1 ms 4364 KB Output is correct
9 Correct 1 ms 4364 KB Output is correct
10 Correct 1 ms 4364 KB Output is correct
11 Correct 3 ms 4364 KB Output is correct
12 Correct 1 ms 4364 KB Output is correct
13 Correct 1 ms 4364 KB Output is correct
14 Correct 3 ms 4364 KB Output is correct
15 Correct 4 ms 4364 KB Output is correct
16 Partially correct 11 ms 4364 KB Partially correct - number of queries: 5160
17 Correct 0 ms 4364 KB Output is correct
18 Correct 1 ms 4364 KB Output is correct
19 Correct 0 ms 4364 KB Output is correct
20 Partially correct 12 ms 4364 KB Partially correct - number of queries: 6057
21 Partially correct 15 ms 4364 KB Partially correct - number of queries: 9938
22 Correct 0 ms 4364 KB Output is correct
23 Correct 0 ms 4364 KB Output is correct
24 Correct 2 ms 4364 KB Output is correct
25 Incorrect 16 ms 4364 KB Incorrect
26 Halted 0 ms 0 KB -