oj.uz

Submission #800911

# Submission time Handle Problem Language Result Execution time Memory
800911 2023-08-02T01:34:28 Z LittleCube The Big Prize (IOI17_prize) C++17
100 / 100
 41 ms 8644 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{
	int n, bad = 0, q = 0;
	vector<int> res[200005];
};

pii how(int k)
{
	if (k == -1)
		return pii(0, bad);
	else if (k == n)
		return pii(bad, 0);
	if (res[k].size() == 0)
		res[k] = ask(k), q++;
	return pii(res[k][0], res[k][1]);
}

vector<int> large;

void update(int l)
{
	large.emplace_back(l);
}

void count(vector<int> v, int l, int r)
{
	int rem = how(r).F - how(l).F - ((r - l - 1) - (int)v.size());
	if (rem == 0)
		return;
	if (rem == v.size())
	{
		for (auto i : v)
			large.emplace_back(i);
		return;
	}

	bool proceed = 1;
	int cur;
	while (proceed)
	{
		if (v.empty())
			return;
		int k = v.size() / 2;
		cur = v[k];
		if (how(cur).F + how(cur).S < bad)
		{
			update(v[k]);
			v.erase(v.begin() + k);
		}
		else
			proceed = 0;
	}
	int k = v.size() / 2;
	vector<int> left(v.begin(), v.begin() + k),
		right(v.begin() + k + 1, v.end());

	count(left, l, cur);
	count(right, cur, r);
}

vector<int> cnt;

void count(int l, int r, int rem)
{
	if (rem <= 0)
		return;
	rem--;
	int m = (l + r) / 2, lrem = rem / 2;
	bad = max(bad, how(m).F + how(m).S);
	cnt.emplace_back(m);
	count(l, m - 1, lrem);
	count(m + 1, r, rem - lrem);
}

int find_best(int n)
{
	::n = n;
	if (n <= 5000)
		for (int i = 0; i < n; i++)
			if (how(i).F + how(i).S == 0)
				return i;

	count(0, n - 1, 480);
	assert(bad <= 480);
	int l = -1, last = 0;
	vector<int> v;
	sort(cnt.begin(), cnt.end());
	cnt.emplace_back(n);
	for (int r : cnt)
	{
		for (int i = last; i < r; i++)
			v.emplace_back(i);
		last = r + 1;
		if (how(r).F + how(r).S < bad)
			update(r);
		else
		{
			count(v, l, r);
			l = r;
			v.clear();
		}
	}

	for (int i : large)
		cerr << i << ' ';
	cerr << '\n';

	if(q > 4320)
		return -1;
	for (int i : large)
		if (how(i) == pii(0, 0))
			return i;
	return 0;
}

Compilation message

prize.cpp: In function 'void count(std::vector<int>, int, int)':
prize.cpp:39:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  if (rem == v.size())
      |      ~~~~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4996 KB Output is correct
2 Correct 7 ms 4996 KB Output is correct
3 Correct 5 ms 5008 KB Output is correct
4 Correct 6 ms 4996 KB Output is correct
5 Correct 6 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 7 ms 5000 KB Output is correct
8 Correct 7 ms 4988 KB Output is correct
9 Correct 5 ms 5084 KB Output is correct
10 Correct 5 ms 5028 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4988 KB Output is correct
2 Correct 6 ms 4944 KB Output is correct
3 Correct 7 ms 4944 KB Output is correct
4 Correct 6 ms 4996 KB Output is correct
5 Correct 7 ms 4944 KB Output is correct
6 Correct 7 ms 4996 KB Output is correct
7 Correct 5 ms 5072 KB Output is correct
8 Correct 6 ms 4988 KB Output is correct
9 Correct 8 ms 5000 KB Output is correct
10 Correct 4 ms 5012 KB Output is correct
11 Correct 10 ms 5000 KB Output is correct
12 Correct 9 ms 4988 KB Output is correct
13 Correct 9 ms 4996 KB Output is correct
14 Correct 11 ms 4944 KB Output is correct
15 Correct 24 ms 5072 KB Output is correct
16 Correct 40 ms 5112 KB Output is correct
17 Correct 19 ms 5228 KB Output is correct
18 Correct 38 ms 5064 KB Output is correct
19 Correct 39 ms 5040 KB Output is correct
20 Correct 18 ms 5064 KB Output is correct
21 Correct 29 ms 5064 KB Output is correct
22 Correct 23 ms 5108 KB Output is correct
23 Correct 6 ms 5040 KB Output is correct
24 Correct 7 ms 5012 KB Output is correct
25 Correct 19 ms 5124 KB Output is correct
26 Correct 35 ms 5200 KB Output is correct
27 Correct 7 ms 4996 KB Output is correct
28 Correct 34 ms 5112 KB Output is correct
29 Correct 33 ms 5060 KB Output is correct
30 Correct 32 ms 5072 KB Output is correct
31 Correct 36 ms 5420 KB Output is correct
32 Correct 7 ms 5004 KB Output is correct
33 Correct 2 ms 4944 KB Output is correct
34 Correct 35 ms 5040 KB Output is correct
35 Correct 6 ms 5036 KB Output is correct
36 Correct 19 ms 5144 KB Output is correct
37 Correct 7 ms 5192 KB Output is correct
38 Correct 4 ms 5016 KB Output is correct
39 Correct 19 ms 5132 KB Output is correct
40 Correct 18 ms 5160 KB Output is correct
41 Correct 29 ms 5116 KB Output is correct
42 Correct 21 ms 5196 KB Output is correct
43 Correct 37 ms 5064 KB Output is correct
44 Correct 31 ms 5112 KB Output is correct
45 Correct 37 ms 5064 KB Output is correct
46 Correct 25 ms 5064 KB Output is correct
47 Correct 22 ms 5132 KB Output is correct
48 Correct 19 ms 5140 KB Output is correct
49 Correct 18 ms 5228 KB Output is correct
50 Correct 32 ms 5040 KB Output is correct
51 Correct 40 ms 5132 KB Output is correct
52 Correct 19 ms 5228 KB Output is correct
53 Correct 6 ms 5012 KB Output is correct
54 Correct 19 ms 5144 KB Output is correct
55 Correct 36 ms 5064 KB Output is correct
56 Correct 21 ms 5132 KB Output is correct
57 Correct 31 ms 5152 KB Output is correct
58 Correct 38 ms 5064 KB Output is correct
59 Correct 33 ms 5116 KB Output is correct
60 Correct 38 ms 5028 KB Output is correct
61 Correct 7 ms 5120 KB Output is correct
62 Correct 9 ms 4984 KB Output is correct
63 Correct 8 ms 5012 KB Output is correct
64 Correct 6 ms 4988 KB Output is correct
65 Correct 5 ms 5084 KB Output is correct
66 Correct 8 ms 4992 KB Output is correct
67 Correct 8 ms 4992 KB Output is correct
68 Correct 6 ms 5136 KB Output is correct
69 Correct 11 ms 4944 KB Output is correct
70 Correct 9 ms 4980 KB Output is correct
71 Correct 30 ms 5112 KB Output is correct
72 Correct 7 ms 5036 KB Output is correct
73 Correct 31 ms 5064 KB Output is correct
74 Correct 32 ms 5028 KB Output is correct
75 Correct 5 ms 4944 KB Output is correct
76 Correct 33 ms 5064 KB Output is correct
77 Correct 34 ms 5068 KB Output is correct
78 Correct 7 ms 4988 KB Output is correct
79 Correct 24 ms 5064 KB Output is correct
80 Correct 33 ms 5112 KB Output is correct
81 Correct 39 ms 5120 KB Output is correct
82 Correct 41 ms 5132 KB Output is correct
83 Correct 7 ms 4940 KB Output is correct
84 Correct 37 ms 5036 KB Output is correct
85 Correct 41 ms 5064 KB Output is correct
86 Correct 6 ms 5396 KB Output is correct
87 Correct 7 ms 4944 KB Output is correct
88 Correct 13 ms 5072 KB Output is correct
89 Correct 7 ms 5128 KB Output is correct
90 Correct 8 ms 4944 KB Output is correct
91 Correct 10 ms 4944 KB Output is correct
92 Correct 8 ms 5000 KB Output is correct
93 Correct 12 ms 8644 KB Output is correct
94 Correct 15 ms 8636 KB Output is correct
95 Correct 12 ms 8644 KB Output is correct
96 Correct 12 ms 8644 KB Output is correct
97 Correct 9 ms 6596 KB Output is correct