oj.uz

Submission #727680

# Submission time Handle Problem Language Result Execution time Memory
727680 2023-04-21T05:54:12 Z jwvg0425 The Big Prize (IOI17_prize) C++17
20 / 100
 124 ms 1120 KB 
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include "prize.h"
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>; 

vector<ii> finded;
int bigSize;

random_device rd;
mt19937 mt(rd());
int outL, outR;

int cntl(int x)
{
	return upper_bound(all(finded), ii{ x, 1 << 30 }) - finded.begin() + outL;
}

int cntr(int x)
{
	return finded.end() - lower_bound(all(finded), ii{ x, -1 }) + outR;
}

bool test(int l, int r)
{
	if (l > r)
		return false;

	int m = (l + r) / 2;
	int ml = m;
	int mlL = 0, mlR = 0;

	while (ml >= l)
	{
		if (any_of(all(finded), [ml](ii x) { return x.xx == ml; }))
		{
			ml--;
			continue;
		}

		auto res = ask(ml);
		if (res[0] + res[1] != bigSize)
		{
			finded.insert(lower_bound(all(finded), ii{ ml, res[0] + res[1] }), ii{ ml, res[0] + res[1] });
			if (res[0] + res[1] == 0)
				return true;
			ml--;
		}
		else
		{
			mlL = res[0];
			mlR = res[1];
			break;
		}
	}

	if (ml > l && mlL != cntl(ml - 1))
		if (test(l, ml - 1))
			return true;

	if (m + 1 <= r && mlR - (m - ml) != cntr(m + 1))
		if (test(m + 1, r))
			return true;

	return false;
}

int find_best(int n)
{
	vector<int> indexs(n);
	for (int i = 0; i < n; i++)
		indexs[i] = i;

	shuffle(all(indexs), mt);
	vector<ii> ix;
	for (int i = 0; i < min(n, 30); i++)
	{
		auto q = ask(indexs[i]);
		ix.emplace_back(q[0] + q[1], indexs[i]);
	}

	sort(all(ix));

	bigSize = ix.back().xx;
	int bucket = 100;
	vector<int> bs;

	for (int i = 0; i < n; i += bucket)
		bs.push_back(i);

	shuffle(all(bs), mt);

	for (auto& bi : bs)
	{
		finded.clear();
		int l = bi, r = min(n - 1, bi + bucket - 1);

		while (l < r)
		{
			auto q = ask(l);
			if (q[0] + q[1] == 0)
				return l;

			if (q[0] + q[1] == bigSize)
			{
				outL = q[0];
				break;
			}

			l++;
		}

		while (l < r)
		{
			auto q = ask(r);
			if (q[0] + q[1] == 0)
				return r;

			if (q[0] + q[1] == bigSize)
			{
				outR = q[1];
				break;
			}

			r--;
		}

		if (test(l + 1, r - 1))
		{
			for (auto& [k, v] : finded)
			{
				if (v == 0)
					return k;
			}
		}
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1104 KB Output is correct
2 Correct 62 ms 1104 KB Output is correct
3 Correct 50 ms 1068 KB Output is correct
4 Correct 15 ms 1064 KB Output is correct
5 Correct 6 ms 1104 KB Output is correct
6 Correct 9 ms 1104 KB Output is correct
7 Correct 8 ms 1112 KB Output is correct
8 Correct 24 ms 1064 KB Output is correct
9 Correct 14 ms 1004 KB Output is correct
10 Correct 48 ms 1104 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 50 ms 1104 KB Partially correct - number of queries: 5872
2 Correct 15 ms 1068 KB Output is correct
3 Correct 15 ms 1120 KB Output is correct
4 Correct 44 ms 1076 KB Output is correct
5 Correct 36 ms 1096 KB Output is correct
6 Correct 36 ms 1060 KB Output is correct
7 Correct 15 ms 1104 KB Output is correct
8 Correct 27 ms 1092 KB Output is correct
9 Correct 17 ms 1072 KB Output is correct
10 Partially correct 40 ms 1104 KB Partially correct - number of queries: 5730
11 Correct 25 ms 1064 KB Output is correct
12 Correct 8 ms 1104 KB Output is correct
13 Correct 33 ms 1076 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 39 ms 1104 KB Output is correct
16 Partially correct 65 ms 1104 KB Partially correct - number of queries: 7245
17 Correct 25 ms 1072 KB Output is correct
18 Partially correct 48 ms 1068 KB Partially correct - number of queries: 5647
19 Correct 31 ms 1104 KB Output is correct
20 Correct 30 ms 688 KB Output is correct
21 Partially correct 91 ms 1072 KB Partially correct - number of queries: 8083
22 Correct 29 ms 1060 KB Output is correct
23 Correct 25 ms 1072 KB Output is correct
24 Correct 37 ms 1072 KB Output is correct
25 Correct 8 ms 1064 KB Output is correct
26 Correct 47 ms 1072 KB Output is correct
27 Correct 14 ms 1064 KB Output is correct
28 Partially correct 41 ms 1044 KB Partially correct - number of queries: 7110
29 Partially correct 71 ms 1096 KB Partially correct - number of queries: 7175
30 Partially correct 77 ms 1052 KB Partially correct - number of queries: 7029
31 Correct 17 ms 1068 KB Output is correct
32 Partially correct 66 ms 1048 KB Partially correct - number of queries: 5719
33 Correct 1 ms 208 KB Output is correct
34 Partially correct 51 ms 1088 KB Partially correct - number of queries: 8475
35 Correct 17 ms 1080 KB Output is correct
36 Correct 12 ms 1072 KB Output is correct
37 Correct 41 ms 1064 KB Output is correct
38 Correct 23 ms 1092 KB Output is correct
39 Correct 17 ms 1096 KB Output is correct
40 Correct 41 ms 1052 KB Output is correct
41 Partially correct 30 ms 1092 KB Partially correct - number of queries: 5516
42 Partially correct 76 ms 1076 KB Partially correct - number of queries: 7120
43 Partially correct 51 ms 1080 KB Partially correct - number of queries: 5048
44 Correct 32 ms 1056 KB Output is correct
45 Correct 21 ms 1076 KB Output is correct
46 Partially correct 74 ms 1104 KB Partially correct - number of queries: 6370
47 Correct 29 ms 1076 KB Output is correct
48 Partially correct 88 ms 1100 KB Partially correct - number of queries: 8090
49 Partially correct 66 ms 1068 KB Partially correct - number of queries: 5847
50 Correct 41 ms 1096 KB Output is correct
51 Partially correct 124 ms 1068 KB Partially correct - number of queries: 7993
52 Partially correct 56 ms 1072 KB Partially correct - number of queries: 5358
53 Correct 28 ms 1064 KB Output is correct
54 Correct 12 ms 1072 KB Output is correct
55 Correct 7 ms 1052 KB Output is correct
56 Partially correct 53 ms 1064 KB Partially correct - number of queries: 5991
57 Partially correct 45 ms 1084 KB Partially correct - number of queries: 6840
58 Correct 26 ms 1068 KB Output is correct
59 Correct 26 ms 1084 KB Output is correct
60 Partially correct 75 ms 1052 KB Partially correct - number of queries: 7068
61 Correct 52 ms 1096 KB Output is correct
62 Partially correct 43 ms 1072 KB Partially correct - number of queries: 5081
63 Correct 26 ms 1072 KB Output is correct
64 Correct 26 ms 1096 KB Output is correct
65 Correct 9 ms 1096 KB Output is correct
66 Correct 38 ms 1104 KB Output is correct
67 Correct 43 ms 1080 KB Output is correct
68 Correct 20 ms 1096 KB Output is correct
69 Correct 17 ms 1068 KB Output is correct
70 Correct 28 ms 1096 KB Output is correct
71 Partially correct 89 ms 1104 KB Partially correct - number of queries: 8799
72 Partially correct 61 ms 1104 KB Partially correct - number of queries: 6207
73 Partially correct 91 ms 1104 KB Partially correct - number of queries: 8793
74 Partially correct 77 ms 1100 KB Partially correct - number of queries: 8805
75 Partially correct 60 ms 1104 KB Partially correct - number of queries: 6018
76 Partially correct 58 ms 1112 KB Partially correct - number of queries: 8088
77 Partially correct 79 ms 1104 KB Partially correct - number of queries: 8463
78 Partially correct 67 ms 1116 KB Partially correct - number of queries: 6190
79 Partially correct 66 ms 1100 KB Partially correct - number of queries: 6790
80 Partially correct 52 ms 1104 KB Partially correct - number of queries: 7723
81 Partially correct 49 ms 1088 KB Partially correct - number of queries: 8411
82 Partially correct 85 ms 1104 KB Partially correct - number of queries: 8406
83 Partially correct 31 ms 1104 KB Partially correct - number of queries: 6027
84 Partially correct 68 ms 1104 KB Partially correct - number of queries: 8037
85 Partially correct 68 ms 1104 KB Partially correct - number of queries: 8587
86 Incorrect 101 ms 1104 KB Incorrect
87 Halted 0 ms 0 KB -