oj.uz

답안 #615970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615970 2022-07-31T16:35:41 Z fvogel499 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 21 ms 1244 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

#define vi vector<int>
#define int long long
#define pb push_back
#define ins insert
#define sz(x) (int)((x).size())

long long count_tastiness(long long x, std::vector<long long> b) {
	while (sz(b) < 60) b.push_back(0);
	int lim [60+1];
	int sum = 0;
	for (int i = 0; i < 60; i++) {
		sum += (1LL<<i)*b[i];
		lim[i] = min(sum/x, (1LL<<(i+1))-1);
	}
	lim[60] = (1LL<<60)-1;
	int dp [60][60+1];
	for (int i = 0; i <= 60; i++) {
		if (lim[0] == 0 || (lim[i]&1) == 0) {
			dp[0][i] = 1;
		}
		else {
			dp[0][i] = 2;
		}
	}
	for (int i = 1; i < 60; i++) for (int j = 0; j <= 60; j++) {
		int resultingMask = (1LL<<(i))-1;
		dp[i][j] = 0;
		if (((lim[i]>>i)&1) && ((lim[j]>>i)&1)) {
            int newJ = j;
            if ((lim[i]&resultingMask) < (lim[j]&resultingMask)) {
                newJ = i;
            }
			dp[i][j] += dp[i-1][newJ]; // add one
			dp[i][j] += dp[i-1][60]; // add zero
		}
		else if (!((lim[i]>>i)&1) && !((lim[j]>>i)&1)) {
			int newJ = j;
            if ((lim[i]&resultingMask) < (lim[j]&resultingMask)) {
                newJ = i;
            }
			dp[i][j] += dp[i-1][newJ]; // add zero
		}
        else if ((lim[i]>>i)&1) {
            dp[i][j] += dp[i-1][j];
        }
        else {
            dp[i][j] += dp[i-1][i];
        }
	}
	int res = dp[60-1][60];
	return res;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.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 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 296 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 20 ms 812 KB Output is correct
3 Correct 18 ms 1108 KB Output is correct
4 Correct 19 ms 1196 KB Output is correct
5 Correct 16 ms 1224 KB Output is correct
6 Correct 16 ms 1156 KB Output is correct
7 Correct 15 ms 1156 KB Output is correct
8 Correct 16 ms 1108 KB Output is correct
9 Correct 16 ms 1188 KB Output is correct
10 Correct 15 ms 1192 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 0 ms 296 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 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 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 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 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 296 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 20 ms 812 KB Output is correct
39 Correct 18 ms 1108 KB Output is correct
40 Correct 19 ms 1196 KB Output is correct
41 Correct 16 ms 1224 KB Output is correct
42 Correct 16 ms 1156 KB Output is correct
43 Correct 15 ms 1156 KB Output is correct
44 Correct 16 ms 1108 KB Output is correct
45 Correct 16 ms 1188 KB Output is correct
46 Correct 15 ms 1192 KB Output is correct
47 Correct 9 ms 340 KB Output is correct
48 Correct 21 ms 1236 KB Output is correct
49 Correct 10 ms 436 KB Output is correct
50 Correct 16 ms 1192 KB Output is correct
51 Correct 19 ms 1236 KB Output is correct
52 Correct 7 ms 340 KB Output is correct
53 Correct 14 ms 1212 KB Output is correct
54 Correct 16 ms 1108 KB Output is correct
55 Correct 16 ms 1204 KB Output is correct
56 Correct 16 ms 1204 KB Output is correct
57 Correct 16 ms 1244 KB Output is correct