oj.uz

Submission #303402

# Submission time Handle Problem Language Result Execution time Memory
303402 2020-09-20T09:39:04 Z Namnamseo Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 886 ms 1072 KB 
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;

map<ll, ll> memo[100];
vector<ll> a;
ll k;
ll x;

ll F(int i, ll carry)
{
	if (i >= k) {
		return carry / x;
	}

	{
		auto ir = memo[i].lower_bound(carry);
		auto il = ir;
		if (il != memo[i].end() && il->first == carry) return il->second;
		if (il != memo[i].begin() && ir != memo[i].end()) {
			--il;
			if (il->second == ir->second) return il->second;
		}
	}

	ll &ret = memo[i][carry];

	ret = !!((a[i] + carry) / x);

	ret += F(i+1, (a[i] + carry) / 2);
	if (a[i] + carry >= x)
		ret += F(i+1, (a[i] + carry - x) / 2);

	{
		auto ir = memo[i].upper_bound(carry);
		if (ir != memo[i].end() && ir->second == ret) {
			auto ir2 = ir;
			if (ir2 != memo[i].end()) {
				++ir2;
				if (ir2->second == ret)
					memo[i].erase(ir);
			}
		}

		auto il = memo[i].lower_bound(carry);
		if (il != memo[i].begin() && (--il)->second == ret) {
			auto il2 = il;
			if (il2 != memo[i].begin()) {
				--il2;
				if (il2->second == ret)
					memo[i].erase(il);
			}
		}
	}

	return ret;
}

ll count_tastiness(ll x, vector<ll> a)
{
	::k = a.size();
	for(int i=0; i<64; ++i) memo[i].clear();
	::a = a;
	::x = x;
	return F(0, 0) + 1;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 189 ms 896 KB Output is correct
3 Correct 166 ms 896 KB Output is correct
4 Correct 161 ms 896 KB Output is correct
5 Correct 143 ms 896 KB Output is correct
6 Correct 225 ms 1016 KB Output is correct
7 Correct 237 ms 904 KB Output is correct
8 Correct 207 ms 896 KB Output is correct
9 Correct 197 ms 1016 KB Output is correct
10 Correct 117 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 8 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 189 ms 896 KB Output is correct
39 Correct 166 ms 896 KB Output is correct
40 Correct 161 ms 896 KB Output is correct
41 Correct 143 ms 896 KB Output is correct
42 Correct 225 ms 1016 KB Output is correct
43 Correct 237 ms 904 KB Output is correct
44 Correct 207 ms 896 KB Output is correct
45 Correct 197 ms 1016 KB Output is correct
46 Correct 117 ms 896 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 32 ms 1016 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 25 ms 768 KB Output is correct
51 Correct 16 ms 896 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 14 ms 768 KB Output is correct
54 Correct 807 ms 1016 KB Output is correct
55 Correct 886 ms 1072 KB Output is correct
56 Correct 815 ms 1016 KB Output is correct
57 Correct 625 ms 1016 KB Output is correct