답안 #816819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
816819 2023-08-09T06:52:31 Z kevinsogo 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
52 ms 860 KB
#include <bits/stdc++.h>
using namespace std;
#include "biscuits.h"
using ll = long long;

ll count_tastiness(ll x, vector<ll> a) {
	a.resize(62);
	vector<ll> t = {0LL};
	for (int i = 0; i < a.size(); i++) t.push_back(t.back() + (a[i] << i));
	for (int i = 0; i < t.size(); i++) t[i] = min(t[i] / x, (1LL << i) - 1);
	vector<unordered_map<ll,ll>> posm(t.size());
	function<ll(ll,int)> poss = [&](ll s, int k) {
		if ((s = min(s, t[k])) < 0) return 0LL;
		if (k == 0) return 1LL;
		if (auto f = posm[k].find(s); f != posm[k].end()) return f->second;
		return posm[k][s] = poss(s, k - 1) + poss(s - (1LL << k - 1), k - 1);
	};
	return poss(t.back(), t.size() - 1);
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:9:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for (int i = 0; i < a.size(); i++) t.push_back(t.back() + (a[i] << i));
      |                  ~~^~~~~~~~~~
biscuits.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int i = 0; i < t.size(); i++) t[i] = min(t[i] / x, (1LL << i) - 1);
      |                  ~~^~~~~~~~~~
biscuits.cpp: In lambda function:
biscuits.cpp:16:59: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   16 |   return posm[k][s] = poss(s, k - 1) + poss(s - (1LL << k - 1), k - 1);
      |                                                         ~~^~~
# 결과 실행 시간 메모리 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 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 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
6 Correct 0 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 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 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 244 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
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 380 KB Output is correct
2 Correct 24 ms 852 KB Output is correct
3 Correct 23 ms 844 KB Output is correct
4 Correct 28 ms 840 KB Output is correct
5 Correct 24 ms 848 KB Output is correct
6 Correct 28 ms 844 KB Output is correct
7 Correct 28 ms 724 KB Output is correct
8 Correct 24 ms 724 KB Output is correct
9 Correct 23 ms 724 KB Output is correct
10 Correct 18 ms 844 KB Output is correct
# 결과 실행 시간 메모리 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 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 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 0 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 0 ms 212 KB Output is correct
20 Correct 0 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 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 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 0 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 244 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 9 ms 380 KB Output is correct
38 Correct 24 ms 852 KB Output is correct
39 Correct 23 ms 844 KB Output is correct
40 Correct 28 ms 840 KB Output is correct
41 Correct 24 ms 848 KB Output is correct
42 Correct 28 ms 844 KB Output is correct
43 Correct 28 ms 724 KB Output is correct
44 Correct 24 ms 724 KB Output is correct
45 Correct 23 ms 724 KB Output is correct
46 Correct 18 ms 844 KB Output is correct
47 Correct 11 ms 340 KB Output is correct
48 Correct 18 ms 836 KB Output is correct
49 Correct 12 ms 384 KB Output is correct
50 Correct 18 ms 752 KB Output is correct
51 Correct 14 ms 840 KB Output is correct
52 Correct 7 ms 340 KB Output is correct
53 Correct 11 ms 744 KB Output is correct
54 Correct 51 ms 852 KB Output is correct
55 Correct 52 ms 860 KB Output is correct
56 Correct 47 ms 852 KB Output is correct
57 Correct 40 ms 848 KB Output is correct