oj.uz

Submission #436313

# Submission time Handle Problem Language Result Execution time Memory
436313 2021-06-24T12:19:22 Z frodakcin Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 171 ms 1328 KB 
#include "biscuits.h"
#include <cstdio>

using ll = long long;

ll x;
std::vector<ll> a;

bool test(ll v) // O(K)
{
	ll n=0;
	for(int i=0;v;v>>=1, n>>=1, ++i)
	{
		if(i<(int)a.size()) n+=a[i];
		if(v&1)
			if((n-=x)<0)
				return 0;
	}
	return 1;
}

ll get(int b) // O(K^2) -- max, with b'th bit turned on
{
	ll v=1ll<<b;
	for(int i=b-1;i>=0;--i)
		if(test(v|1ll<<i))
			v|=1ll<<i;
	return v;
}

const int MX = 2e5; // idk, just smth large
ll stv[MX];
int l[MX], r[MX], X;

int nn(int p=0)
{
	++X;
	stv[X]=stv[p];
	l[X]=l[p];
	r[X]=r[p];
	return X;
}

void up(int n) // do NOT call on leaves
{
	stv[n]=stv[l[n]]+stv[r[n]];
}

int pull(int n, ll nl, ll nr, ll ql, ll qr)
{
	if(ql <= nl && nr <= qr) return n;
	if(nr-nl>1)
	{
		n = nn(n);
		ll m=nl+(nr-nl)/2;
		if(ql < m) l[n] = pull(l[n], nl, m, ql, qr); else l[n]=0;
		if(m < qr) r[n] = pull(r[n], m, nr, ql, qr); else r[n]=0;
		up(n);
	}
	return n;
}

long long count_tastiness(long long _x, std::vector<long long> _a)
{
	x=_x;
	a=_a;

	X=0;
	int root=nn();
	stv[root]=1;

	for(int i=0;;++i)
	{
		int nroot = nn();
		l[nroot] = root;
		r[nroot] = 0;

		if(test(1ll<<i))
		{
			ll bound = get(i);
			bound ^= 1ll<<i;
			r[nroot] = pull(root, 0, 1ll<<i, 0, bound+1);
			//printf("%d: %lld [%lld]\n", i, bound+1, stv[r[nroot]]);
		}
		else if(i>=(int)a.size()) break;

		root = nroot;
		up(root);
		//printf("%d: %lld\n", i, stv[root]);
	}
	return stv[root];
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 380 KB Output is correct
2 Correct 44 ms 1180 KB Output is correct
3 Correct 44 ms 1208 KB Output is correct
4 Correct 64 ms 1196 KB Output is correct
5 Correct 45 ms 1168 KB Output is correct
6 Correct 31 ms 1100 KB Output is correct
7 Correct 31 ms 1164 KB Output is correct
8 Correct 37 ms 1136 KB Output is correct
9 Correct 40 ms 1068 KB Output is correct
10 Correct 45 ms 1140 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 3 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 2 ms 204 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 232 KB Output is correct
27 Correct 3 ms 204 KB Output is correct
28 Correct 3 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 2 ms 204 KB Output is correct
31 Correct 2 ms 204 KB Output is correct
32 Correct 2 ms 204 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 3 ms 204 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 3 ms 204 KB Output is correct
37 Correct 8 ms 380 KB Output is correct
38 Correct 44 ms 1180 KB Output is correct
39 Correct 44 ms 1208 KB Output is correct
40 Correct 64 ms 1196 KB Output is correct
41 Correct 45 ms 1168 KB Output is correct
42 Correct 31 ms 1100 KB Output is correct
43 Correct 31 ms 1164 KB Output is correct
44 Correct 37 ms 1136 KB Output is correct
45 Correct 40 ms 1068 KB Output is correct
46 Correct 45 ms 1140 KB Output is correct
47 Correct 30 ms 388 KB Output is correct
48 Correct 156 ms 1304 KB Output is correct
49 Correct 81 ms 392 KB Output is correct
50 Correct 171 ms 1132 KB Output is correct
51 Correct 18 ms 1328 KB Output is correct
52 Correct 3 ms 332 KB Output is correct
53 Correct 11 ms 1168 KB Output is correct
54 Correct 93 ms 1160 KB Output is correct
55 Correct 81 ms 1180 KB Output is correct
56 Correct 75 ms 1192 KB Output is correct
57 Correct 60 ms 1204 KB Output is correct