답안 #500908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500908 2022-01-01T16:03:42 Z InternetPerson10 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
10 ms 1236 KB
#include "biscuits.h"
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;

vector<ll> v;
vector<ll> k;

ll rec(int i, ll x) { // the last x are blocked, find total number of blocked

	if(i < (int)k.size()) {
		if(x <= k[i]) return v[i];
	}
	if(i == 0) {
		if(v.size() == 0) return x;
		if(x == 1) return x;
		return v[i];
	}
	if(x < ((ll)1 << (i))) {
		return v[i-1] + rec(i-1, x);
	}
	return ((ll)1 << (i)) + rec(i-1, x - ((ll)1 << (i)));
}

long long count_tastiness(long long x, std::vector<long long> a) {
	vector<ll>().swap(v);
	vector<ll>().swap(k);
	ll tot = 0;
	for(int i = 0; i < 61; i++) {
		if(x * ((ll)1 << (i+1)) > (ll)2000000000000000000) break;
		if(i == (int)a.size()) a.push_back(0);
		tot += ((ll)1 << i)*a[i];
		if(tot >= x*((ll)1 << (i+1)) - 1) {
			v.push_back(rec(i, 0));
			k.push_back(0);
		}
		else {
			v.push_back(rec(i, ((ll)1 << (i+1)) - tot/x - 1));
			k.push_back(((ll)1 << (i+1)) - tot/x - 1);
		}
	}
	return ((ll)1 << v.size()) - v[v.size()-1];
}

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 7 ms 1100 KB Output is correct
4 Correct 8 ms 1120 KB Output is correct
5 Correct 8 ms 1140 KB Output is correct
6 Correct 8 ms 1072 KB Output is correct
7 Correct 7 ms 1080 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 7 ms 1072 KB Output is correct
10 Correct 7 ms 1100 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 292 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 216 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 3 ms 332 KB Output is correct
38 Correct 10 ms 1092 KB Output is correct
39 Correct 7 ms 1100 KB Output is correct
40 Correct 8 ms 1120 KB Output is correct
41 Correct 8 ms 1140 KB Output is correct
42 Correct 8 ms 1072 KB Output is correct
43 Correct 7 ms 1080 KB Output is correct
44 Correct 7 ms 1100 KB Output is correct
45 Correct 7 ms 1072 KB Output is correct
46 Correct 7 ms 1100 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 9 ms 1236 KB Output is correct
49 Correct 3 ms 332 KB Output is correct
50 Correct 7 ms 1168 KB Output is correct
51 Correct 8 ms 1220 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 7 ms 1052 KB Output is correct
54 Correct 8 ms 1228 KB Output is correct
55 Correct 10 ms 1096 KB Output is correct
56 Correct 9 ms 1092 KB Output is correct
57 Correct 9 ms 1192 KB Output is correct