Q(这个题提交失败，但样例是对的QAQ，好像服务器有问题，不能提交)

最新推荐文章于 2020-06-14 11:08:45 发布

胖亚亚

最新推荐文章于 2020-06-14 11:08:45 发布

阅读量563

点赞数

分类专栏：二分贪心练习

本文链接：https://blog.csdn.net/qq_37748451/article/details/71075741

版权

二分贪心练习专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Description

Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.

$\text{[math]}$

Each Karafs has a positive integer height. Tavas has an infinite 1-based sequence of Karafses. The height of the i-th Karafs is s_i = A + (i - 1) × B.

For a given m, let's define an m-bite operation as decreasing the height of at most m distinct not eaten Karafses by 1. Karafs is considered as eaten when its height becomes zero.

Now SaDDas asks you n queries. In each query he gives you numbers l, t and m and you should find the largest number r such that l ≤ r and sequence s_l, s_l + 1, ..., s_r can be eaten by performing m-bite no more than t times or print -1 if there is no such number r.

Input

The first line of input contains three integers A, B and n (1 ≤ A, B ≤ 10⁶, 1 ≤ n ≤ 10⁵).

Next n lines contain information about queries. i-th line contains integers l, t, m (1 ≤ l, t, m ≤ 10⁶) for i-th query.

Output

For each query, print its answer in a single line.

Sample Input

Input

Output

4
-1
8
-1

Input

1 5 2
1 5 10
2 7 4

Output

1
2


题目分析
这个题目蛮难读的，谷歌翻译还不如自己翻译QAQ
现在给你一个以A为基，B为公差的等差数列（无现长），其中有N个询问。
对于N个询问，每个询问有三个元素，l，t，m；
表示我们现在有t次操作，每次可以选择m个数将其都-1.
现在问你能够使得以l为起点，r为终点最远的r，区间【l，r】所有数都减少为0.解题思路
显然这个终点r越远，需要的操作就越多，其具有单调性，那么我们二分终点。进行判断。
如果当前终点可行，那么让这个终点更远一些，否则就更近一些。
源代码
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
long long A,B,n;
long long get(long long mid)
{
    return A+(mid-1)*B;
}
long long gs(long long l,long long r)
{
    long long rr=(A+A+(r-1)*B)*r/2;
    long long lll=(A+A+(l-2)*B)*(l-1)/2;
    return rr-lll;
}
int main()
{
    while(~scanf("%I64d%I64d%I64d",&A,&B,&n))
    {
        for(long long i=0;i<n;i++)
        {
            long long s,t,m;
            scanf("%I64d%I64d%I64d",&s,&t,&m);
            long long left=s;
            long long right=1000000000;
            long long ans=-1;
            while(right-left>=0)
            {
                long long  mid=(right+left)/2;
                if(get(mid)>t)right=mid-1;
                else
                {
                    if(gs(s,mid)>m*t)
                    {
                        right=mid-1;
                    }
                    else
                    {
                        ans=mid;
                        left=mid+1;
                    }
                }
            }
            printf("%d\n",ans);
        }
    }
}