Submission #136082

# Submission time Handle Problem Language Result Execution time Memory
136082 2019-07-24T17:22:20 Z JustasZ The Big Prize (IOI17_prize) C++14
90 / 100
73 ms 504 KB
#include "prize.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
/*vector<int> ask(int i)
{
	cout << "? " << i << endl;
	vector<int>a(2);
	cin >> a[0] >> a[1];
	return a;
}*/
int bl = 700;
int find_best(int n)
{
	vector<int>a, b;
	int mx = 0;
	for(int i = 0; i < min(n, 500); i++)
	{
		a = ask(i);
		if(a[0] + a[1] == 0)
			return i;
		mx = max(mx, a[0] + a[1]);
	}
	for(int i = 500; i < n; i += bl)
	{
		int j = min(i + bl - 1, n - 1);
		int p = i;
		a = ask(p);
		while(a[0] + a[1] != mx)
		{
			if(a[0] + a[1] == 0)
				return p;
			p++;
			if(p > j)
				break;
			a = ask(p);
		}
		b = ask(j);
		while(b[0] + b[1] != mx)
		{
			if(b[0] + b[1] == 0)
				return j;
			j--;
			if(j < p)
				break;
			b = ask(j);
		}
		if(p < j)
		{
			int between = b[0] - a[0];
			if(between != 0)
			{
				int it = p + 1;
				while(it < j && between > 0)
				{
					a = ask(it);
					if(a[0] + a[1] != mx)
					{
						between--;
						if(a[0] + a[1] == 0)
							return it;
					}
					else
					{
						int l = it, r = j - 1;
						while(l < r)
						{
							int mid = (l + r) / 2;
							b = ask(mid);
							if(b[0] + b[1] != mx)
								r = mid;
							else
							{
								if(b[0] > a[0])
									r = mid - 1;
								else
									l = mid + 1;
							} 
						}
						it = l;
						a = ask(it);
						--between;
						if(a[0] + a[1] == 0)
							return it;
					}
					++it;
				}
			}
		}
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:103:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 9 ms 248 KB Output is correct
2 Correct 11 ms 248 KB Output is correct
3 Correct 9 ms 380 KB Output is correct
4 Correct 14 ms 376 KB Output is correct
5 Correct 10 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 248 KB Output is correct
8 Correct 10 ms 248 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 13 ms 248 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 10 ms 248 KB Output is correct
3 Correct 10 ms 376 KB Output is correct
4 Correct 10 ms 312 KB Output is correct
5 Correct 11 ms 248 KB Output is correct
6 Correct 2 ms 396 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 7 ms 396 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 9 ms 248 KB Output is correct
13 Correct 14 ms 316 KB Output is correct
14 Correct 9 ms 248 KB Output is correct
15 Correct 14 ms 248 KB Output is correct
16 Partially correct 54 ms 376 KB Partially correct - number of queries: 5142
17 Correct 6 ms 248 KB Output is correct
18 Partially correct 56 ms 248 KB Partially correct - number of queries: 6103
19 Correct 4 ms 376 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 30 ms 248 KB Output is correct
22 Correct 12 ms 320 KB Output is correct
23 Correct 8 ms 376 KB Output is correct
24 Correct 8 ms 248 KB Output is correct
25 Correct 19 ms 312 KB Output is correct
26 Correct 26 ms 248 KB Output is correct
27 Correct 7 ms 248 KB Output is correct
28 Partially correct 65 ms 312 KB Partially correct - number of queries: 5677
29 Correct 49 ms 248 KB Output is correct
30 Partially correct 51 ms 316 KB Partially correct - number of queries: 6073
31 Correct 4 ms 376 KB Output is correct
32 Correct 15 ms 376 KB Output is correct
33 Correct 2 ms 248 KB Output is correct
34 Correct 23 ms 376 KB Output is correct
35 Correct 11 ms 376 KB Output is correct
36 Correct 20 ms 376 KB Output is correct
37 Correct 8 ms 248 KB Output is correct
38 Correct 8 ms 376 KB Output is correct
39 Correct 31 ms 276 KB Output is correct
40 Partially correct 50 ms 248 KB Partially correct - number of queries: 5391
41 Correct 37 ms 248 KB Output is correct
42 Correct 43 ms 248 KB Output is correct
43 Correct 20 ms 248 KB Output is correct
44 Correct 26 ms 376 KB Output is correct
45 Correct 13 ms 380 KB Output is correct
46 Correct 7 ms 248 KB Output is correct
47 Correct 16 ms 376 KB Output is correct
48 Correct 28 ms 248 KB Output is correct
49 Correct 12 ms 248 KB Output is correct
50 Partially correct 58 ms 376 KB Partially correct - number of queries: 6103
51 Correct 30 ms 376 KB Output is correct
52 Correct 7 ms 316 KB Output is correct
53 Correct 13 ms 320 KB Output is correct
54 Correct 28 ms 248 KB Output is correct
55 Correct 4 ms 312 KB Output is correct
56 Partially correct 62 ms 248 KB Partially correct - number of queries: 6120
57 Correct 32 ms 376 KB Output is correct
58 Correct 50 ms 248 KB Output is correct
59 Correct 32 ms 504 KB Output is correct
60 Correct 37 ms 248 KB Output is correct
61 Correct 7 ms 392 KB Output is correct
62 Correct 7 ms 376 KB Output is correct
63 Correct 13 ms 376 KB Output is correct
64 Correct 10 ms 248 KB Output is correct
65 Correct 7 ms 312 KB Output is correct
66 Correct 7 ms 376 KB Output is correct
67 Correct 13 ms 308 KB Output is correct
68 Correct 6 ms 248 KB Output is correct
69 Correct 15 ms 248 KB Output is correct
70 Correct 12 ms 376 KB Output is correct
71 Partially correct 61 ms 248 KB Partially correct - number of queries: 6075
72 Correct 16 ms 248 KB Output is correct
73 Partially correct 66 ms 376 KB Partially correct - number of queries: 6005
74 Partially correct 60 ms 252 KB Partially correct - number of queries: 6035
75 Correct 12 ms 376 KB Output is correct
76 Partially correct 53 ms 376 KB Partially correct - number of queries: 5355
77 Partially correct 32 ms 248 KB Partially correct - number of queries: 6067
78 Correct 9 ms 376 KB Output is correct
79 Correct 34 ms 376 KB Output is correct
80 Partially correct 32 ms 504 KB Partially correct - number of queries: 6069
81 Partially correct 62 ms 248 KB Partially correct - number of queries: 6069
82 Partially correct 53 ms 308 KB Partially correct - number of queries: 5988
83 Correct 15 ms 248 KB Output is correct
84 Partially correct 49 ms 248 KB Partially correct - number of queries: 5148
85 Partially correct 73 ms 248 KB Partially correct - number of queries: 6028
86 Correct 15 ms 376 KB Output is correct
87 Correct 13 ms 376 KB Output is correct
88 Correct 12 ms 376 KB Output is correct
89 Correct 13 ms 248 KB Output is correct
90 Correct 7 ms 392 KB Output is correct
91 Correct 8 ms 396 KB Output is correct
92 Correct 7 ms 504 KB Output is correct
93 Correct 16 ms 376 KB Output is correct
94 Correct 12 ms 376 KB Output is correct
95 Correct 14 ms 276 KB Output is correct
96 Correct 18 ms 376 KB Output is correct
97 Correct 12 ms 248 KB Output is correct