제출 #1224583

#제출 시각아이디문제언어결과실행 시간메모리
1224583MarwenElarbiPacking Biscuits (IOI20_biscuits)C++17
0 / 100
1 ms324 KiB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, std::vector<long long> a) {
    long long sum=0,j=0;
    vector<long long> b(63,0);
    bool test=false;
    int nab=1;
    for (int i = 0; i < a.size(); ++i)
    {
        b[i]+=a[i];
        if(b[i]>1){
            b[i+1]+=(b[i]-1)/2;
            if((b[i]-1)%2) b[i]=2;
            else b[i]=1;
        }
        sum+=1ll*(a[i]*(1ll<<i));
        if(b[i]==0) j++;
        if(b[i]>=1) test=true;
        if(b[i]==0&&test) nab=1;
        //cout <<b[i]<<" ";
    }
    //int i=0;
    //while(i<a.size()&&a[i]==0) i++;
    return (sum/(1ll<<(j)))+nab+1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...