oj.uz

답안 #457991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
457991 2021-08-07T17:25:43 Z rainboy 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 21 ms 1356 KB 
#include "biscuits.h"

using namespace std;

typedef vector<long long> vll;

const int N = 60;

long long min(long long a, long long b) { return a < b ? a : b; }

long long lim[N], dp[N][N];

long long count_tastiness(long long x, vll aa) {
	int n = aa.size(), i, j;
	long long a;

	a = 0;
	for (i = 0; i < N; i++) {
		if (i < n)
			a += aa[i] << i;
		lim[i] = min(a / x, (1LL << i + 1) - 1);
	}
	for (i = 0; i < N; i++)
		for (j = i; j < N; j++) {
			if (i == 0)
				dp[i][j] = (lim[j] & 1LL << i) != 0 ? 2 : 1;
			else
				dp[i][j] = ((lim[j] & 1LL << i) != 0 ? dp[i - 1][i - 1] : 0) + dp[i - 1][(lim[j] & (1LL << i) - 1) < (lim[i - 1] & (1LL << i) - 1) ? j : i - 1];
		}
	return dp[N - 1][N - 1];
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, vll)':
biscuits.cpp:21:33: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   21 |   lim[i] = min(a / x, (1LL << i + 1) - 1);
      |                               ~~^~~
biscuits.cpp:28:99: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   28 |     dp[i][j] = ((lim[j] & 1LL << i) != 0 ? dp[i - 1][i - 1] : 0) + dp[i - 1][(lim[j] & (1LL << i) - 1) < (lim[i - 1] & (1LL << i) - 1) ? j : i - 1];
      |                                                                                        ~~~~~~~~~~~^~~
biscuits.cpp:28:131: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   28 |     dp[i][j] = ((lim[j] & 1LL << i) != 0 ? dp[i - 1][i - 1] : 0) + dp[i - 1][(lim[j] & (1LL << i) - 1) < (lim[i - 1] & (1LL << i) - 1) ? j : i - 1];
      |                                                                                                                        ~~~~~~~~~~~^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 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 0 ms 204 KB Output is correct
13 Correct 0 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 0 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 332 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 ms 288 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

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 16 ms 1176 KB Output is correct
3 Correct 16 ms 1100 KB Output is correct
4 Correct 20 ms 1212 KB Output is correct
5 Correct 16 ms 1100 KB Output is correct
6 Correct 17 ms 1068 KB Output is correct
7 Correct 17 ms 1168 KB Output is correct
8 Correct 19 ms 1136 KB Output is correct
9 Correct 21 ms 1140 KB Output is correct
10 Correct 17 ms 1100 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 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 0 ms 204 KB Output is correct
13 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 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 332 KB Output is correct
24 Correct 1 ms 288 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 288 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 16 ms 1176 KB Output is correct
39 Correct 16 ms 1100 KB Output is correct
40 Correct 20 ms 1212 KB Output is correct
41 Correct 16 ms 1100 KB Output is correct
42 Correct 17 ms 1068 KB Output is correct
43 Correct 17 ms 1168 KB Output is correct
44 Correct 19 ms 1136 KB Output is correct
45 Correct 21 ms 1140 KB Output is correct
46 Correct 17 ms 1100 KB Output is correct
47 Correct 7 ms 332 KB Output is correct
48 Correct 19 ms 1356 KB Output is correct
49 Correct 7 ms 416 KB Output is correct
50 Correct 14 ms 1100 KB Output is correct
51 Correct 15 ms 1348 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 16 ms 1072 KB Output is correct
54 Correct 16 ms 1176 KB Output is correct
55 Correct 15 ms 1100 KB Output is correct
56 Correct 16 ms 1100 KB Output is correct
57 Correct 17 ms 1228 KB Output is correct