oj.uz

Submission #645904

# Submission time Handle Problem Language Result Execution time Memory
645904 2022-09-28T09:06:52 Z prvocislo Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 423 ms 1432 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
#include "biscuits.h"
typedef long long ll;
typedef long double ld;
using namespace std;

int n;
map<vector<ll>, ll> m;
ll rek(ll x, vector<ll> a)
{
	if (a.empty()) return 1;
	if (m.count(a)) return m[a];
	ll& ans = m[a] = 0;
	ll val = a.back();
	a.pop_back();
	ans = rek(x, a) * (a.size() + 1 == n ? (val / x + 1) : min(2ll, val / x + 1));
	if (val < x || a.size() + 1 == n)
	{
		ll mis = x - (val % x);
		for (int i = (int)a.size() - 1; i >= 0; i--)
		{
			if (mis > 2 * x) break;
			mis *= 2ll;
			ll k = min(a[i], mis);
			a[i] -= k;
			mis -= k;
			if (mis == 0)
			{
				while (a.size() > 1 && a[a.size() - 2] == 0) a.pop_back();
				ans += rek(x, a);
				break;
			}
		}
	}
	return ans;
}
ll count_tastiness(ll x, vector<ll> a) 
{
	m.clear();
	n = a.size();
	for (int i = 0; i + 1 < n; i++)
	{
		if (a[i] >= x)
		{
			ll k = (a[i] - x) / 2ll;
			a[i] -= 2 * k;
			a[i + 1] += k;
		}
	}
	return rek(x, a);
}

Compilation message

biscuits.cpp: In function 'll rek(ll, std::vector<long long int>)':
biscuits.cpp:29:34: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |  ans = rek(x, a) * (a.size() + 1 == n ? (val / x + 1) : min(2ll, val / x + 1));
      |                     ~~~~~~~~~~~~~^~~~
biscuits.cpp:30:30: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |  if (val < x || a.size() + 1 == n)
      |                 ~~~~~~~~~~~~~^~~~

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 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 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 296 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 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 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 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 4 ms 428 KB Output is correct
12 Correct 7 ms 428 KB Output is correct
13 Correct 6 ms 428 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 116 ms 880 KB Output is correct
3 Correct 115 ms 1244 KB Output is correct
4 Correct 111 ms 1236 KB Output is correct
5 Correct 116 ms 1244 KB Output is correct
6 Correct 145 ms 1228 KB Output is correct
7 Correct 142 ms 1232 KB Output is correct
8 Correct 132 ms 1200 KB Output is correct
9 Correct 138 ms 1356 KB Output is correct
10 Correct 88 ms 1212 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 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 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 296 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 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 4 ms 428 KB Output is correct
35 Correct 7 ms 428 KB Output is correct
36 Correct 6 ms 428 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 116 ms 880 KB Output is correct
39 Correct 115 ms 1244 KB Output is correct
40 Correct 111 ms 1236 KB Output is correct
41 Correct 116 ms 1244 KB Output is correct
42 Correct 145 ms 1228 KB Output is correct
43 Correct 142 ms 1232 KB Output is correct
44 Correct 132 ms 1200 KB Output is correct
45 Correct 138 ms 1356 KB Output is correct
46 Correct 88 ms 1212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 87 ms 1360 KB Output is correct
49 Correct 1 ms 312 KB Output is correct
50 Correct 71 ms 1196 KB Output is correct
51 Correct 42 ms 1364 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 27 ms 1192 KB Output is correct
54 Correct 423 ms 1352 KB Output is correct
55 Correct 402 ms 1308 KB Output is correct
56 Correct 347 ms 1432 KB Output is correct
57 Correct 283 ms 1312 KB Output is correct