oj.uz

답안 #726253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
726253 2023-04-18T17:13:15 Z myrcella 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 12 ms 1256 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "biscuits.h"

ll ans[60],mx[60];

ll getval(int cur,ll val) {
	if (val<0) return 0;
	if (val==0) return 1;
	if (val-(1ll<<cur)>=mx[cur]) return ans[cur];
	return getval(cur-1,val) + getval(cur-1,val-(1ll<<cur));
}

long long count_tastiness(long long x, std::vector<long long> a) {
	while (SZ(a)<60) a.pb(0);
	ans[0] = a[0]>=x?2:1;
	ll pre = a[0];
	rep(i,1,60) {
		pre += a[i]*(1ll<<i);
		ll tmp = (pre-x*(1ll<<i));
		tmp/=x;
		tmp = min(tmp,(1ll<<i)-1);
		if (pre/(1ll<<i)<x) tmp=-1;
		mx[i] = tmp;
		ans[i] = ans[i-1] + getval(i-1,tmp);
	}
	return ans[59];
}

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 1 ms 212 KB Output is correct
4 Correct 0 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 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 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 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 1 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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 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 296 KB Output is correct
13 Correct 1 ms 300 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 8 ms 1108 KB Output is correct
3 Correct 8 ms 1108 KB Output is correct
4 Correct 8 ms 1108 KB Output is correct
5 Correct 8 ms 1180 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 7 ms 1152 KB Output is correct
8 Correct 8 ms 1108 KB Output is correct
9 Correct 8 ms 1108 KB Output is correct
10 Correct 7 ms 1076 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 1 ms 212 KB Output is correct
4 Correct 0 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 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 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 0 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 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 1 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 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 296 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 8 ms 1108 KB Output is correct
39 Correct 8 ms 1108 KB Output is correct
40 Correct 8 ms 1108 KB Output is correct
41 Correct 8 ms 1180 KB Output is correct
42 Correct 8 ms 1108 KB Output is correct
43 Correct 7 ms 1152 KB Output is correct
44 Correct 8 ms 1108 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 7 ms 1076 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 10 ms 1236 KB Output is correct
49 Correct 3 ms 384 KB Output is correct
50 Correct 9 ms 1236 KB Output is correct
51 Correct 9 ms 1256 KB Output is correct
52 Correct 2 ms 400 KB Output is correct
53 Correct 7 ms 1108 KB Output is correct
54 Correct 10 ms 1080 KB Output is correct
55 Correct 12 ms 1184 KB Output is correct
56 Correct 10 ms 1204 KB Output is correct
57 Correct 10 ms 1216 KB Output is correct