제출 #795775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795775		alexander707070	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1079 ms	340 KiB

biscuits

#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
 
const long long mod=1e9+7;
 
long long x,sum;
int k;
vector<long long> br;
 
long long brute(int bit,long long total,int pos,vector<long long> br){
    pos=min(pos,bit);
    if(bit==-1)return 1;
    
    long long curr=br[bit];
    total-=curr*(1LL<<bit); br[bit]=0;
    long long res=brute(bit-1,total,pos,br);
    total+=curr*(1LL<<bit); br[bit]=curr;
 
    curr=x;
    if(total>=x*(1LL<<bit)){
        total-=x*(1LL<<bit);
        
        for(int i=pos;i>=0;i--){
            if(br[i]>=curr){
                br[i]-=curr; 
                curr=0; break;
            }else{
                curr-=br[i]; 
                br[i]=0; curr*=2;
                pos=i-1;
            }
        }

        total-=br[bit]*(1LL<<bit); br[bit]=0;
        res+=brute(bit-1,total,pos,br);
    }
 
    return res;
}
 
long long count_tastiness(long long X,vector<long long> A){
    k=int(A.size()); x=X; sum=0;
    br.resize(62); 
 
    for(int i=0;i<k;i++){
        br[i]=A[i]; 
        sum+=br[i]*(1LL<<i);
    }
 
    return brute(61,sum,61,br);
}
 
/*
int main(){
    cout<<count_tastiness(2, {2, 1, 2})<<"\n";
    cout<<count_tastiness(2, {2, 1, 2})<<"\n";
}
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23