oj.uz

Submission #303977

# Submission time Handle Problem Language Result Execution time Memory
303977 2020-09-20T21:56:41 Z amoo_safar Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 421 ms 1016 KB 
// Peyman !
#include "biscuits.h"

#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;

const int N = 62;

vector<ll> a;

ll dp[N + 1], sz[N + 1], x;

bool Valid(ll A){
	ll nw = 0;
	for(int i = 0; i < 62; i++){
		nw = (nw / 2) + (a[i]);
		if(A >> i & 1){
			if(x > nw) return false;
			nw -= x;
		}
	}
	return true;
}
ll Get(int bt, ll idx){
	if(bt == 0){
		return idx;
	}
	if(idx < dp[bt - 1])
		return Get(bt - 1, idx);
	return Get(bt - 1, idx - dp[bt - 1]) + (1ll << bt);
}

ll count_tastiness(ll _x, vector<ll> _a) {
	a = _a;
	x = _x;
	a.resize(N, 0);

	dp[0] = (a[0] >= x ? 2 : 1);

	for(int i = 1; i < N; i++){
		ll L = 0, R = dp[i - 1] + 1, mid;
		while(L + 1 < R){
			mid = (L + R) >> 1;
			if(Valid(Get(i - 1, mid - 1) + (1ll << i))) L = mid; 
			else R = mid;
		}
		sz[i] = L;
		dp[i] = dp[i - 1] + L;
	}
	return dp[N - 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 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 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 2 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 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 3 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 6 ms 256 KB Output is correct
12 Correct 5 ms 256 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 117 ms 384 KB Output is correct
2 Correct 148 ms 888 KB Output is correct
3 Correct 139 ms 892 KB Output is correct
4 Correct 141 ms 888 KB Output is correct
5 Correct 152 ms 896 KB Output is correct
6 Correct 149 ms 896 KB Output is correct
7 Correct 149 ms 888 KB Output is correct
8 Correct 147 ms 888 KB Output is correct
9 Correct 147 ms 896 KB Output is correct
10 Correct 140 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 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 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 2 ms 256 KB Output is correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 4 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 4 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 4 ms 256 KB Output is correct
27 Correct 4 ms 256 KB Output is correct
28 Correct 4 ms 256 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 4 ms 256 KB Output is correct
31 Correct 3 ms 256 KB Output is correct
32 Correct 3 ms 256 KB Output is correct
33 Correct 6 ms 256 KB Output is correct
34 Correct 6 ms 256 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 117 ms 384 KB Output is correct
38 Correct 148 ms 888 KB Output is correct
39 Correct 139 ms 892 KB Output is correct
40 Correct 141 ms 888 KB Output is correct
41 Correct 152 ms 896 KB Output is correct
42 Correct 149 ms 896 KB Output is correct
43 Correct 149 ms 888 KB Output is correct
44 Correct 147 ms 888 KB Output is correct
45 Correct 147 ms 896 KB Output is correct
46 Correct 140 ms 896 KB Output is correct
47 Correct 204 ms 436 KB Output is correct
48 Correct 348 ms 896 KB Output is correct
49 Correct 308 ms 504 KB Output is correct
50 Correct 341 ms 888 KB Output is correct
51 Correct 18 ms 896 KB Output is correct
52 Correct 9 ms 384 KB Output is correct
53 Correct 16 ms 768 KB Output is correct
54 Correct 421 ms 888 KB Output is correct
55 Correct 395 ms 884 KB Output is correct
56 Correct 345 ms 1016 KB Output is correct
57 Correct 291 ms 888 KB Output is correct