Can You Eat Your Favorite Candy on Your Favorite Day?
You are given a (0-indexed) array of positive integers candiesCount where candiesCount[i] represents the number of candies of the i^th type you have. You are also given a 2D array queries where queries[i] = [favoriteTypei, favoriteDayi, dailyCapi].
You play a game with the following rules:
- You start eating candies on day
0. - You cannot eat any candy of type
iunless you have eaten all candies of typei - 1. - You must eat at least one candy per day until you have eaten all the candies.
Construct a boolean array answer such that answer.length == queries.length and answer[i] is true if you can eat a candy of type favoriteTypei on day favoriteDayi without eating more than dailyCapi candies on any day, and false otherwise. Note that you can eat different types of candy on the same day, provided that you follow rule 2.
Return the constructed array answer.
Example 1
Input
candiesCount = [7,4,5,3,8], queries = [[0,2,2],[4,2,4],[2,13,1000000000]]Output
[true,false,true]If you eat 2 candies of type 0 on days 0 and 1, you can eat type 0 on day 2; with cap 4 you cannot reach type 4 by day 2; and eating 1 candy each day lets you eat type 2 on day 13.
Example 2
Input
candiesCount = [5,2,6,4,1], queries = [[3,1,2],[4,10,3],[3,10,100],[4,100,30],[1,3,1]]Output
[false,true,true,false,false]Each query is evaluated by whether a valid daily eating schedule can include the favorite type on the favorite day without exceeding the given daily cap.
Constraints
- 1 <= candiesCount.length <= 10^5
- 1 <= candiesCount[i] <= 10^5
- 1 <= queries.length <= 10^5
- queries[i].length == 3
- 0 <= favoriteTypei < candiesCount.length
- 0 <= favoriteDayi <= 10^9
- 1 <= dailyCapi <= 10^9