oj.uz

Submission #730800

# Submission time Handle Problem Language Result Execution time Memory
730800 2023-04-26T12:39:01 Z josanneo22 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 34 ms 828 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;

long long count_tastiness(long long x, std::vector<long long> a){
	vector<lint> thres;
	a.resize(60);
	lint ret = 0;
	for(int i = 0; i < sz(a); i++){
		ret += (a[i] << i);
		thres.push_back(ret / x);
	}
	vector<pi> cur;
	cur = {pi((1ll << 60) - 1, 1)};
	for(int i = sz(a) - 1; i >= 0; i--){
		vector<pi> nxt;
		for(auto &j : cur) j.first = min(j.first, thres[i]);
		for(auto &j : cur){
			if(j.first >= (1ll << i)){
				nxt.emplace_back(j.first - (1ll << i), j.second);
				nxt.emplace_back((1ll << i) - 1, j.second);
			}
			else{
				nxt.emplace_back(j.first, j.second);
			}
		}
		sort(all(nxt));
		cur.clear();
		for(auto &i : nxt){
			if(sz(cur) && cur.back().first == i.first){
				cur.back().second += i.second;
			}
			else cur.push_back(i);
		}
	}
	ret = 0;
	for(auto &i : cur) ret += i.second;
	return ret;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 17 ms 724 KB Output is correct
3 Correct 21 ms 816 KB Output is correct
4 Correct 16 ms 824 KB Output is correct
5 Correct 15 ms 824 KB Output is correct
6 Correct 23 ms 724 KB Output is correct
7 Correct 19 ms 824 KB Output is correct
8 Correct 16 ms 724 KB Output is correct
9 Correct 16 ms 816 KB Output is correct
10 Correct 15 ms 824 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 17 ms 724 KB Output is correct
39 Correct 21 ms 816 KB Output is correct
40 Correct 16 ms 824 KB Output is correct
41 Correct 15 ms 824 KB Output is correct
42 Correct 23 ms 724 KB Output is correct
43 Correct 19 ms 824 KB Output is correct
44 Correct 16 ms 724 KB Output is correct
45 Correct 16 ms 816 KB Output is correct
46 Correct 15 ms 824 KB Output is correct
47 Correct 6 ms 340 KB Output is correct
48 Correct 17 ms 828 KB Output is correct
49 Correct 10 ms 368 KB Output is correct
50 Correct 15 ms 736 KB Output is correct
51 Correct 11 ms 724 KB Output is correct
52 Correct 4 ms 340 KB Output is correct
53 Correct 9 ms 724 KB Output is correct
54 Correct 32 ms 820 KB Output is correct
55 Correct 33 ms 816 KB Output is correct
56 Correct 34 ms 816 KB Output is correct
57 Correct 26 ms 816 KB Output is correct