oj.uz

답안 #601849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601849 2022-07-22T11:00:45 Z FatihSolak 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 169 ms 1324 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define N 200005
using namespace std;
long long vals[N];
long long count_tastiness(long long x, vector<long long> a){
	int k = a.size();
	vector<long long> pre = a;
	for(int i = 1;i<k;i++){
		pre[i] = pre[i-1] + a[i] * (1ll<<i);
	}
	for(int i = 0;i<k;i++){
		pre[i] /= x;
	}
	for(int i = k-2;i>=0;i--){
		pre[i] = min(pre[i],pre[i+1]);
	}
	while(pre.size() < 60)
		pre.push_back(pre.back());
	vals[0] = 0;
	long long sz = 1;
	vector<long long> nums;
	nums.push_back(sz);
	for(int i = 0;i<60;i++){
		long long l = -1,r = sz-1;
		while(l < r){
			//cout << l << " " << r << endl;
			long long m = (l + r + 1)/2;
			long long tmp = m + 1;
			//cout << m << endl;
			long long curval = 0;
			for(int j = i-1;j>=0;j--){
				if(tmp > nums[j]){
					curval += (1ll<<j);
					tmp -= nums[j];
				}
			}
			//cout << curval << " " << pre[i] << endl;
			if(curval + (1ll<<i) <= pre[i]){
				l = m;
			}
			else r = m-1;
		}
		//cout << l << endl;
		sz += l + 1;
		// int tmp = sz;
		// for(int j = 0;j<tmp;j++){
		// 	if(vals[j] + (1ll<<i) <= pre[i]){
		// 		vals[sz++] = vals[j] + (1ll<<i);
		// 	}
		// 	else break;
		// }
		nums.push_back(sz);
	}
	long long ans = sz;
	return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 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 2 ms 312 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 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 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 340 KB Output is correct
2 Correct 57 ms 812 KB Output is correct
3 Correct 56 ms 724 KB Output is correct
4 Correct 59 ms 820 KB Output is correct
5 Correct 56 ms 828 KB Output is correct
6 Correct 64 ms 824 KB Output is correct
7 Correct 62 ms 812 KB Output is correct
8 Correct 62 ms 820 KB Output is correct
9 Correct 65 ms 816 KB Output is correct
10 Correct 59 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 312 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 2 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 212 KB Output is correct
23 Correct 2 ms 312 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 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 2 ms 212 KB Output is correct
31 Correct 2 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 3 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 41 ms 340 KB Output is correct
38 Correct 57 ms 812 KB Output is correct
39 Correct 56 ms 724 KB Output is correct
40 Correct 59 ms 820 KB Output is correct
41 Correct 56 ms 828 KB Output is correct
42 Correct 64 ms 824 KB Output is correct
43 Correct 62 ms 812 KB Output is correct
44 Correct 62 ms 820 KB Output is correct
45 Correct 65 ms 816 KB Output is correct
46 Correct 59 ms 724 KB Output is correct
47 Correct 71 ms 408 KB Output is correct
48 Correct 91 ms 1324 KB Output is correct
49 Correct 94 ms 444 KB Output is correct
50 Correct 93 ms 1172 KB Output is correct
51 Correct 10 ms 1296 KB Output is correct
52 Correct 4 ms 408 KB Output is correct
53 Correct 9 ms 1108 KB Output is correct
54 Correct 169 ms 1176 KB Output is correct
55 Correct 165 ms 1180 KB Output is correct
56 Correct 145 ms 1200 KB Output is correct
57 Correct 126 ms 1204 KB Output is correct