oj.uz

Submission #308534

# Submission time Handle Problem Language Result Execution time Memory
308534 2020-10-01T13:38:03 Z jwvg0425 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 43 ms 896 KB 
#include "biscuits.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

struct Solver
{
	Solver(i64 xv, const vector<i64>& a)
		: x(xv), value(62), cnt(62), maxBit(0)
	{
		for (int i = 0; i < a.size(); i++)
			value[i] = (1ll << i) * a[i];

		for (int i = 1; i < 62; i++)
			value[i] += value[i - 1];

		i64 maxv = value[61];

		while ((1ll << maxBit) <= maxv / x)
			maxBit++;
	}

	i64 solve()
	{
		i64 res = 1;
		for (int i = 0; i < maxBit; i++)
		{
			i64 need = x * (1ll << i);
			i64 now = value[i];
			if (now < need)
				continue;

			now -= need;

			// 내려가면서, bit 위치 1인 경우 센다.
			int fst = -1;
			for (int bit = i - 1; bit >= 0; bit--)
			{
				if (now < x * (1ll << bit) ||  value[bit] < x * (1ll << bit))
					continue;

				fst = bit;
				break;
			}

			if (fst != -1)
				cnt[i] = calc(fst, now);
			else
				cnt[i] = 1;

			res += cnt[i];
		}

		return res;
	}

	i64 calc(int bit, i64 lim)
	{
		i64 res = 1; // 000..0
		for (int j = 0; j < bit; j++)
			res += cnt[j];

		lim -= x * (1ll << bit);
		i64 now = value[bit] - (x * (1ll << bit));
		lim = min(lim, now);

		bool isNxt = false;
		for (int j = bit - 1; j >= 0; j--)
		{
			if (lim < x * (1ll << j) || value[j] < x * (1ll << j))
				continue;

			res += calc(j, lim);
			isNxt = true;
			break;
		}

		if (!isNxt)
			res++;

		return res;
	}

	i64 x;
	int maxBit;
	vector<i64> value;
	vector<i64> cnt;
};

i64 count_tastiness(i64 x, vector<i64> a)
{
	Solver s(x, a);
	return s.solve();
}

Compilation message

biscuits.cpp: In constructor 'Solver::Solver(i64, const std::vector<long long int>&)':
biscuits.cpp:111:14: warning: 'Solver::cnt' will be initialized after [-Wreorder]
  111 |  vector<i64> cnt;
      |              ^~~
biscuits.cpp:109:6: warning:   'int Solver::maxBit' [-Wreorder]
  109 |  int maxBit;
      |      ^~~~~~
biscuits.cpp:32:2: warning:   when initialized here [-Wreorder]
   32 |  Solver(i64 xv, const vector<i64>& a)
      |  ^~~~~~
biscuits.cpp:35:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for (int i = 0; i < a.size(); i++)
      |                   ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 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 1 ms 256 KB Output is correct
13 Correct 1 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 0 ms 256 KB Output is correct
2 Correct 1 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 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 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 1 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 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct

Subtask #4
35.0 / 35.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 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 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 14 ms 896 KB Output is correct
39 Correct 15 ms 896 KB Output is correct
40 Correct 14 ms 896 KB Output is correct
41 Correct 14 ms 896 KB Output is correct
42 Correct 14 ms 896 KB Output is correct
43 Correct 12 ms 896 KB Output is correct
44 Correct 11 ms 896 KB Output is correct
45 Correct 13 ms 804 KB Output is correct
46 Correct 12 ms 896 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 43 ms 888 KB Output is correct
49 Correct 17 ms 384 KB Output is correct
50 Correct 39 ms 768 KB Output is correct
51 Correct 13 ms 896 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 11 ms 768 KB Output is correct
54 Correct 21 ms 888 KB Output is correct
55 Correct 19 ms 896 KB Output is correct
56 Correct 19 ms 896 KB Output is correct
57 Correct 16 ms 896 KB Output is correct