oj.uz

답안 #615669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615669 2022-07-31T11:50:18 Z Koosha_mv 비스킷 담기 (IOI20_biscuits) C++14
100 / 100
 61 ms 936 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&d)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define big __int128

const int N=122;
const big d=1;

ll dp[N][N];
big res[N];
int n;

int comp(int i,int j){
	big mask=(d<<(i+1))-1;
	return (res[i]&mask)<=(res[j]&mask);
}

ll count_tastiness(ll x,vector<ll> a) {
	f(i,0,N) f(j,0,N) dp[i][j]=0;
	n=a.size();
	// warning !!!!
	f(i,0,60) a.pb(0),n++;
	res[n]=(d<<(n+1))-1;
	big sum=0;
	f(i,0,n){
		sum+=d*(d<<i)*a[i];
		res[i]=min((d<<(i+1))-1,sum/x);
		//eror(res[i]);
	}
	dp[n][n]=1;
	f_(i,n,0){
		f(j,i,n+1){
			//cout<<i<<" "<<j<<" -> "<<dp[i][j]<<endl;
			if(i==0) continue ;
			int now=j;
			if(comp(i-1,now)) now=i-1;
			if(bit(res[now],i-1)==0){
				dp[i-1][now]+=dp[i][j];
			}
			else{
				dp[i-1][n]+=dp[i][j];
				dp[i-1][now]+=dp[i][j];
			}
		}
	}
	ll ans=0;
	f(i,0,n+1) ans+=dp[0][i];
	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 492 KB Output is correct
2 Correct 57 ms 936 KB Output is correct
3 Correct 57 ms 852 KB Output is correct
4 Correct 56 ms 928 KB Output is correct
5 Correct 58 ms 920 KB Output is correct
6 Correct 58 ms 900 KB Output is correct
7 Correct 59 ms 924 KB Output is correct
8 Correct 61 ms 920 KB Output is correct
9 Correct 56 ms 852 KB Output is correct
10 Correct 55 ms 852 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 16 ms 492 KB Output is correct
38 Correct 57 ms 936 KB Output is correct
39 Correct 57 ms 852 KB Output is correct
40 Correct 56 ms 928 KB Output is correct
41 Correct 58 ms 920 KB Output is correct
42 Correct 58 ms 900 KB Output is correct
43 Correct 59 ms 924 KB Output is correct
44 Correct 61 ms 920 KB Output is correct
45 Correct 56 ms 852 KB Output is correct
46 Correct 55 ms 852 KB Output is correct
47 Correct 17 ms 468 KB Output is correct
48 Correct 59 ms 924 KB Output is correct
49 Correct 18 ms 492 KB Output is correct
50 Correct 46 ms 840 KB Output is correct
51 Correct 56 ms 936 KB Output is correct
52 Correct 17 ms 492 KB Output is correct
53 Correct 45 ms 724 KB Output is correct
54 Correct 56 ms 936 KB Output is correct
55 Correct 56 ms 924 KB Output is correct
56 Correct 57 ms 936 KB Output is correct
57 Correct 61 ms 928 KB Output is correct