class Solution:
    def canEat(self, candiesCount: List[int], queries: List[List[int]]) -> List[bool]:
        res = []
        prefix_sum = [0]
        for i in range(1, len(candiesCount) + 1):
            prefix_sum.append(prefix_sum[-1] + candiesCount[i - 1])
            
        # print(len(prefix_sum))
        
        for q in queries:
            favType = q[0]
            favDay = q[1]
            dayCap = q[2]
            
            # 敞开了吃，都不能在favDay结束的时候把前面的糖果吃完
            # 这里需要算上favDay，一共吃favDay + 1天
            if (favDay + 1) * dayCap <= prefix_sum[favType]:
                res.append(False)
                continue
            # 省着吃，在favDay之前就已经把favType吃完
            if favDay >= prefix_sum[favType + 1]:
                res.append(False)
                continue
            res.append(True)
            
        return res

class Solution {
public:
    typedef long long LL;
    
    vector<bool> canEat(vector<int>& candiesCount, vector<vector<int>>& queries) {
        LL prefix_sum[100010] = { 0 };
        // prefix_sum[i]: candiesCount[0]加到candiesCount[i - 1]
        
        bool check = false;
        for (int i = 1; i <= candiesCount.size(); ++i)
        {
            prefix_sum[i] = prefix_sum[i - 1] + candiesCount[i - 1];
            // cout << "i = " << i << ": " << prefix_sum[i] << " ";
        }
        
        LL favDay, favType, dayCap;
        vector<bool> res;
        for (auto t : queries)
        {
            favDay = t[1];
            favType = t[0];
            dayCap = t[2];
            
            // 第favDay之前，一共吃了favDay天
            // 每天开足马力吃，都吃不完前面的
            // prefix_sum[favType] = candiesCount[0] 加到 candiesCount[favType - 1]
            // 即开始吃favType之前的糖果总和
            if ((favDay + 1) * dayCap <= prefix_sum[favType])
            {
                res.push_back(false);
                continue;
            }
            // 每天省着吃，都吃不够
            if (favDay >= prefix_sum[favType + 1])
            {
                res.push_back(false);
                continue;
            }
            res.push_back(true);
        }
        
        return res;
    }
};