oj.uz

답안 #308377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308377 2020-10-01T01:52:21 Z tincan 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 104 ms 1016 KB 
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<deque>
#include<string>
#include<unordered_map>
#include<bitset>
#include<random>
#include<chrono>
#include<cstdarg>
//Eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
using namespace std;
const int MAXN = 61;
typedef long long ul;
map<ul, ul> dp;
ul X;
vector<ul> psa;
ul f(ul i) {
	if (i == 0) return 1;
	if (i < 0) return 0;
	if (dp.find(i) == dp.end()) {
		ul mx = 0;
		for (mx = MAXN; mx >= 0; mx--) if (i >> mx & 1) break;
		dp[i] = f((1LL << mx) - 1) + f(min(i, psa[mx] / X) - (1LL << mx));
	}
	return dp[i];
}
ul count_tastiness(ul x, vector<ul> a) {
	X = x; a.resize(MAXN);
	dp.clear();
	psa = vector<ul>(MAXN);
	psa[0] = a[0];
	for (int i = 1; i < MAXN; i++) psa[i] = psa[i - 1] + (a[i] << i);
	return f((1LL << 60)-1);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 35 ms 896 KB Output is correct
3 Correct 34 ms 896 KB Output is correct
4 Correct 34 ms 1016 KB Output is correct
5 Correct 33 ms 896 KB Output is correct
6 Correct 42 ms 896 KB Output is correct
7 Correct 43 ms 896 KB Output is correct
8 Correct 39 ms 896 KB Output is correct
9 Correct 39 ms 896 KB Output is correct
10 Correct 30 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 13 ms 384 KB Output is correct
38 Correct 35 ms 896 KB Output is correct
39 Correct 34 ms 896 KB Output is correct
40 Correct 34 ms 1016 KB Output is correct
41 Correct 33 ms 896 KB Output is correct
42 Correct 42 ms 896 KB Output is correct
43 Correct 43 ms 896 KB Output is correct
44 Correct 39 ms 896 KB Output is correct
45 Correct 39 ms 896 KB Output is correct
46 Correct 30 ms 896 KB Output is correct
47 Correct 15 ms 384 KB Output is correct
48 Correct 32 ms 888 KB Output is correct
49 Correct 20 ms 384 KB Output is correct
50 Correct 29 ms 768 KB Output is correct
51 Correct 22 ms 896 KB Output is correct
52 Correct 11 ms 448 KB Output is correct
53 Correct 22 ms 768 KB Output is correct
54 Correct 104 ms 896 KB Output is correct
55 Correct 100 ms 1016 KB Output is correct
56 Correct 85 ms 896 KB Output is correct
57 Correct 74 ms 1016 KB Output is correct