Submission #304433

#	Time	Username	Problem	Language	Result	Execution time	Memory
304433		Masalmah	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	37 ms	432 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long count_tastiness(long long x, vector<long long> a) {
        long long lo= 0, hi= 2e18, y;
        while (hi- lo> 1) {
                y= (hi+ lo)/ 2;

                vector<long long> proc;
                for (int i= 0; i< (int)a.size(); i++) proc.push_back(a[i]);
                while (proc.size()< 60) proc.push_back(0);

                bool nt= 1;
                for (int B= 59; B>= 0; B--) {
                        long long cnt= 0;
                        if (y&((long long)1<< B)) {
                                cnt= x;
                                if (proc[B]>= cnt) {
                                        proc[B]-= cnt;
                                        cnt= 0;
                                } else {
                                        for (int BB= B; BB>= 0; BB--) {
                                                int ct= min(cnt, proc[BB]);
                                                cnt-= ct;
                                                proc[BB]-= ct;
                                                if (cnt== 0) {
                                                        break;
                                                } else cnt*= 2;
                                        }
                                }
                        }

                        if (cnt) {
                                nt= 0;
                                break;
                        }
                }
                if (nt) {
                        lo= y;
                }else hi= y;
        }
        return lo;
}

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