oj.uz

Submission #825274

# Submission time Handle Problem Language Result Execution time Memory
825274 2023-08-14T16:33:46 Z fatemetmhr Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 74 ms 1364 KB 
//  ~ Be Name Khoda ~  //

#include "biscuits.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  2e18;

ll x, sum[100], a[100];


vector <ll> solve(int i, vector <ll> need){
	vector <ll> av;
	if(i == -1){
		av.resize(int(need.size()) + 1);
		fill(all(av), 1);
		return av;
	}
	for(int j = 0; j < need.size(); j++)
		need[j] = max(need[j], 0ll);
	need.pb(0);
	//cout << i << ' ' << need.size() << ' ' << sum[i] << endl;
	for(auto y : need){
		if(inf / x > (1ll << i) && sum[i] - y >= (1ll << i) * x)
			av.pb(y + (x - a[i]) * (1ll << i));
		else
			av.pb(y - a[i] * (1ll << i));
	}
	av = solve(i - 1, av);
	for(int j = 0; j < int(av.size()) - 1; j++){
		if(inf / x > (1ll << i) && sum[i] - need[j] >= (1ll << i) * x)
			av[j] += av.back();
		//cout << "* " << i << ' ' << j << ' ' << need[j] << ' ' << av[j] << ' ' << endl;
	}
	av.pop_back();
	return av;
}

long long count_tastiness(long long xx, std::vector<long long> aa) {
	x = xx;
	memset(a, 0, sizeof a);
	memset(sum, 0, sizeof sum);
	for(int i = 0; i < int(aa.size()); i++){
		a[i] = aa[i];
		sum[i] = a[i] * (1ll << i);
		if(i)
			sum[i] += sum[i - 1];
	}
	for(int i = aa.size(); i < 60; i++)
		sum[i] = sum[i - 1];
	vector <ll> av;
	av = solve(59, av);
	//cout << "hey " << av.size() << endl;
	return av.back();
}

Compilation message

biscuits.cpp: In function 'std::vector<long long int> solve(int, std::vector<long long int>)':
biscuits.cpp:36:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int j = 0; j < need.size(); j++)
      |                 ~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 420 KB Output is correct
2 Correct 51 ms 1236 KB Output is correct
3 Correct 50 ms 1236 KB Output is correct
4 Correct 50 ms 1244 KB Output is correct
5 Correct 58 ms 1240 KB Output is correct
6 Correct 53 ms 1180 KB Output is correct
7 Correct 63 ms 1200 KB Output is correct
8 Correct 58 ms 1196 KB Output is correct
9 Correct 52 ms 1220 KB Output is correct
10 Correct 59 ms 1108 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 368 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 368 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 304 KB Output is correct
37 Correct 46 ms 420 KB Output is correct
38 Correct 51 ms 1236 KB Output is correct
39 Correct 50 ms 1236 KB Output is correct
40 Correct 50 ms 1244 KB Output is correct
41 Correct 58 ms 1240 KB Output is correct
42 Correct 53 ms 1180 KB Output is correct
43 Correct 63 ms 1200 KB Output is correct
44 Correct 58 ms 1196 KB Output is correct
45 Correct 52 ms 1220 KB Output is correct
46 Correct 59 ms 1108 KB Output is correct
47 Correct 45 ms 340 KB Output is correct
48 Correct 74 ms 1364 KB Output is correct
49 Correct 56 ms 468 KB Output is correct
50 Correct 74 ms 1196 KB Output is correct
51 Correct 43 ms 1340 KB Output is correct
52 Correct 36 ms 480 KB Output is correct
53 Correct 32 ms 1236 KB Output is correct
54 Correct 60 ms 1220 KB Output is correct
55 Correct 62 ms 1236 KB Output is correct
56 Correct 60 ms 1244 KB Output is correct
57 Correct 58 ms 1260 KB Output is correct