1744. Can You Eat Your Favorite Candy on Your Favorite Day?, C++ (gcc)

Language: Layout:

typedef long long int ll;

class Solution {
public:
    vector<bool> canEat(vector<int>& candiesCount, vector<vector<int>>& queries) {
        int n = candiesCount.size();
        vector<ll> pre(n);
        pre[0] = candiesCount[0];
        for (int j = 1; j < n; j ++) pre[j] = pre[j-1] + candiesCount[j];
        
        vector<bool> ans;
        for (auto q : queries) {
            ll t = q[0], d = q[1], limit = q[2];
            d ++;
            
            bool cur = false;
            
            if (pre[t] < d) cur = false;
            else {
                // 4 5 7 8 (2)
                ll can = ceil((double)pre[t]/(double)limit);
                if (can > d) {
                    ll bef = t > 0? pre[t-1] : 0;
                    can = ceil((double)(bef+1)/(double)limit);
                    if (can > d) cur = false;
                    else cur = true;
                }
                else cur = true;
            }
                
            ans.push_back(cur);
        }
        return ans;
    }
};

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 1.22 sec, absolute running time: 0.15 sec, cpu time: 0.01 sec, memory peak: 5 Mb, absolute service time: 1,38 sec