oj.uz

답안 #547547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547547 2022-04-10T23:00:06 Z LucaDantas 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 62 ms 1304 KB 
#include "biscuits.h"
#include <cassert>
#include <algorithm>
#include <cstdio>
#include <map>

long long x;
std::vector<long long> s;

std::map<long long, long long> mp;

long long g(long long n) {
	if(n <= 0) return 0;
	if(n == 1) return 1;
	if(mp.count(n)) return mp[n];
	// retorno quantos caras menores que n são validos

	int i = 63-__builtin_clzll(n) - (__builtin_popcountll(n)==1);

	/* printf("%lld %d\n", n, i);
	fflush(stdout); */

	// opção 1: não usar o i-ésimo bit
	long long ans = g(1ll<<i);

	// opção 2: usar o i-ésimo bit, porém tenho que garantir que a soma do valor é suficiente
	// aka as: s[i] >= y*x ==(estou usando o i-ésimo bit)=> s[i]/x > (y' + 1<<i) - 1 ==> s[i]/x + 1 - (1<<i) > y'
	ans += g(std::min(n, s[i]/x + 1) - (1ll << i));

	mp[n] = ans;

	return ans;
}

long long count_tastiness(long long X, std::vector<long long> a) {
	mp.clear();
	x = X;
	s = a;
	while(s.size() < 60) s.push_back(0);
	for(int i = 1; i < s.size(); i++)
		s[i] = (1ll << i) * s[i] + s[i-1];
	return g(1ll<<60);
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:40:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i = 1; i < s.size(); i++)
      |                 ~~^~~~~~~~~~

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 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 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 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 1 ms 212 KB Output is correct
5 Correct 1 ms 232 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 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.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 0 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 7 ms 364 KB Output is correct
2 Correct 23 ms 852 KB Output is correct
3 Correct 21 ms 724 KB Output is correct
4 Correct 21 ms 820 KB Output is correct
5 Correct 19 ms 816 KB Output is correct
6 Correct 24 ms 724 KB Output is correct
7 Correct 24 ms 724 KB Output is correct
8 Correct 26 ms 724 KB Output is correct
9 Correct 25 ms 816 KB Output is correct
10 Correct 16 ms 724 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 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 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 1 ms 212 KB Output is correct
19 Correct 1 ms 232 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 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 0 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 7 ms 364 KB Output is correct
38 Correct 23 ms 852 KB Output is correct
39 Correct 21 ms 724 KB Output is correct
40 Correct 21 ms 820 KB Output is correct
41 Correct 19 ms 816 KB Output is correct
42 Correct 24 ms 724 KB Output is correct
43 Correct 24 ms 724 KB Output is correct
44 Correct 26 ms 724 KB Output is correct
45 Correct 25 ms 816 KB Output is correct
46 Correct 16 ms 724 KB Output is correct
47 Correct 8 ms 364 KB Output is correct
48 Correct 19 ms 1304 KB Output is correct
49 Correct 9 ms 304 KB Output is correct
50 Correct 16 ms 1108 KB Output is correct
51 Correct 13 ms 1224 KB Output is correct
52 Correct 6 ms 340 KB Output is correct
53 Correct 14 ms 1116 KB Output is correct
54 Correct 62 ms 1060 KB Output is correct
55 Correct 56 ms 1184 KB Output is correct
56 Correct 52 ms 1200 KB Output is correct
57 Correct 41 ms 1200 KB Output is correct