oj.uz

답안 #833558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833558 2023-08-22T06:50:53 Z Sohsoh84 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 12 ms 1292 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define sep			' '
#define debug(x)		cerr << #x << ": " << x << endl;

const int MAXN = 61; // TODO

inline bool ovf_mul(ll a, ll b) {
	ll mx = numeric_limits<ll>::max();
	return b > mx / a;
}

ll A[MAXN], dp[MAXN], ps[MAXN], x;

inline ll f(ll i, ll mask) {
	if (i == 0) return (mask == 0 ? 1 : dp[i]);
	if (mask >= (1ll << (i + 1))) return dp[i];
	if (!(mask >> i & 1ll)) return f(i - 1, mask);
	
	ll tmask = mask ^ (1ll << i);
	if (A[i] >= x) return f(i - 1, tmask) + dp[i - 1];
	ll fmask = ps[i] / x - (1ll << i);
	if (fmask < 0) return dp[i - 1];

	return dp[i - 1] + f(i - 1, min(fmask, tmask));
}

ll count_tastiness (ll x_, vector<ll> a_) {
	x = x_;
	memset(A, 0, sizeof A);
	memset(dp, 0, sizeof dp);
	memset(ps, 0, sizeof ps);

	for (int i = 0; i < int(a_.size()); i++) {
		A[i] = a_[i];
		ps[i] = (A[i] << i);
	}
	
	dp[0] = (A[0] >= x ? 2 : 1);
	for (int i = 1; i < MAXN; i++) {
		ps[i] += ps[i - 1];
		dp[i] = dp[i - 1];
		
		ll m = ps[i] / x - (1ll << i);
		if (m >= 0) dp[i] += f(i - 1, m);

	}

	return dp[MAXN - 1];
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 336 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 9 ms 1168 KB Output is correct
3 Correct 9 ms 1108 KB Output is correct
4 Correct 12 ms 1108 KB Output is correct
5 Correct 9 ms 1108 KB Output is correct
6 Correct 8 ms 1116 KB Output is correct
7 Correct 8 ms 1108 KB Output is correct
8 Correct 8 ms 1080 KB Output is correct
9 Correct 8 ms 1108 KB Output is correct
10 Correct 8 ms 1108 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 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 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 336 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 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 2 ms 340 KB Output is correct
38 Correct 9 ms 1168 KB Output is correct
39 Correct 9 ms 1108 KB Output is correct
40 Correct 12 ms 1108 KB Output is correct
41 Correct 9 ms 1108 KB Output is correct
42 Correct 8 ms 1116 KB Output is correct
43 Correct 8 ms 1108 KB Output is correct
44 Correct 8 ms 1080 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 8 ms 1108 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 9 ms 1236 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 7 ms 1108 KB Output is correct
51 Correct 7 ms 1292 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 7 ms 1108 KB Output is correct
54 Correct 12 ms 1108 KB Output is correct
55 Correct 12 ms 1188 KB Output is correct
56 Correct 12 ms 1108 KB Output is correct
57 Correct 10 ms 1224 KB Output is correct