oj.uz

답안 #410466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410466 2021-05-22T18:11:19 Z 534351 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 66 ms 1280 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()

const int MAXN = 61;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int K;
ll X;
ll arr[MAXN], sum[MAXN];
map<ll, ll> dp[MAXN];

ll solve(int e, ll mx)
{
	ll c = sum[e], pw = (1ll << e);
	ckmin(mx, c);
	// cerr << "solve " << e << ' ' << mx << endl;
	if (e == 0)
	{
		return mx + 1;
	}
	if (dp[e].count(mx))
	{
		return dp[e][mx];
	}
	ll res = 0;
	if (mx >= pw)
	{
		res = solve(e - 1, pw - 1) + solve(e - 1, mx - pw);
	}
	else
	{
		res = solve(e - 1, mx);
	}
	dp[e][mx] = res;
	return res;
	//the part mod 2^e can be at most c.
}

ll count_tastiness(ll x, vl a)
{
	X = x;
	K = SZ(a);
	FOR(i, 0, K)
	{
		arr[i] = a[i];
	}
	FOR(i, 0, K)
	{
		sum[i] = arr[i] * (1ll << i) + (i == 0 ? 0 : sum[i - 1]);
	}
	while(sum[K - 1] / X >= (1ll << K))
	{
		sum[K] = sum[K - 1];
		K++;
	}
	FOR(i, 0, K)
	{
		sum[i] /= X;
		ckmin(sum[i], (2ll << i) - 1);
		dp[i].clear();
		// cerr << "sum " << sum[i] << endl;
	}
	return solve(K - 1, (1ll << K) - 1);
	//try to count numbers by their earliest violation?
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 224 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 26 ms 832 KB Output is correct
3 Correct 29 ms 1204 KB Output is correct
4 Correct 24 ms 1100 KB Output is correct
5 Correct 24 ms 1076 KB Output is correct
6 Correct 33 ms 1144 KB Output is correct
7 Correct 36 ms 1100 KB Output is correct
8 Correct 27 ms 1160 KB Output is correct
9 Correct 26 ms 1100 KB Output is correct
10 Correct 18 ms 1156 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 2 ms 224 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 4 ms 460 KB Output is correct
38 Correct 26 ms 832 KB Output is correct
39 Correct 29 ms 1204 KB Output is correct
40 Correct 24 ms 1100 KB Output is correct
41 Correct 24 ms 1076 KB Output is correct
42 Correct 33 ms 1144 KB Output is correct
43 Correct 36 ms 1100 KB Output is correct
44 Correct 27 ms 1160 KB Output is correct
45 Correct 26 ms 1100 KB Output is correct
46 Correct 18 ms 1156 KB Output is correct
47 Correct 5 ms 364 KB Output is correct
48 Correct 21 ms 1280 KB Output is correct
49 Correct 10 ms 332 KB Output is correct
50 Correct 21 ms 1156 KB Output is correct
51 Correct 15 ms 1256 KB Output is correct
52 Correct 2 ms 372 KB Output is correct
53 Correct 12 ms 1152 KB Output is correct
54 Correct 66 ms 1220 KB Output is correct
55 Correct 62 ms 1088 KB Output is correct
56 Correct 58 ms 1216 KB Output is correct
57 Correct 47 ms 1232 KB Output is correct