2013长沙站A题||hdu4791 思维题

最新推荐文章于 2020-05-04 06:38:49 发布

life4711

最新推荐文章于 2020-05-04 06:38:49 发布

阅读量1k

点赞数 1

分类专栏：二分

本文链接：https://blog.csdn.net/lvshubao1314/article/details/38864841

版权

二分专栏收录该内容

18 篇文章 0 订阅

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=4791

Problem Description

Alice is providing print service, while the pricing doesn't seem to be reasonable, so people using her print service found some tricks to save money.
For example, the price when printing less than 100 pages is 20 cents per page, but when printing not less than 100 pages, you just need to pay only 10 cents per page. It's easy to figure out that if you want to print 99 pages, the best choice is to print an extra blank page so that the money you need to pay is 100 × 10 cents instead of 99 × 20 cents.
Now given the description of pricing strategy and some queries, your task is to figure out the best ways to complete those queries in order to save money.

Input

The first line contains an integer T (≈ 10) which is the number of test cases. Then T cases follow.
Each case contains 3 lines. The first line contains two integers n, m (0 < n, m ≤ 10 ⁵ ). The second line contains 2n integers s ₁, p ₁ , s ₂, p ₂ , ..., s _n, p _n (0=s ₁ < s ₂ < ... < s _n ≤ 10 ⁹ , 10 ⁹ ≥ p ₁ ≥ p ₂ ≥ ... ≥ p _n ≥ 0).. The price when printing no less than s _i but less than s _i+1 pages is p _i cents per page (for i=1..n-1). The price when printing no less than s _n pages is p _n cents per page. The third line containing m integers q ₁ .. q _m (0 ≤ q _i ≤ 10 ⁹ ) are the queries.

Output

For each query q _i, you should output the minimum amount of money (in cents) to pay if you want to print q _i pages, one output in one line.

Sample Input

  
  
   
   1
2 3
0 20 100 10
0 99 100

Sample Output

题目大意：购物时，当商品达到一定的数量就会相应的便宜，现在给出价格分流的点和各个区间的价格，求买x件物品使用怎样的方法能花费最少。

解题思路：求出x所在的价格，由于购买越多价格越低，因此之需要比较比x多的区间起点（即价格改变点）最低价格与不采取措施，直接购买的价格孰低孰高就可以了。查找x所在价格是用到了二分，否则会超时的。

#include <stdio.h>
#include <string.h>
#include <iostream>
//#define debug
using namespace std;
typedef unsigned long long ULL;
ULL sum[100005];
int a[100005],b[100005];
int n,m;
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
            scanf("%d%d",&a[i],&b[i]);
        ULL minn=0x3f3f3f3f3f3f;
        for(int i=n-1;i>=0;i--)
        {
            minn=min((ULL)a[i]*b[i],minn);
            sum[i]=minn;
        }
        #ifdef debug
        for(int i=0;i<n;i++)
           printf("%I64d ",sum[i]);
        printf("\n");
        #endif
        while(m--)
        {
            int t,tmp;
            scanf("%d",&t);
            int l=0,r=n-1;
            while(l<=r)
            {
                int mid=(l+r)/2;
                if(a[mid]<=t)
                {
                    tmp=mid;
                    l=mid+1;
                }
                else
                    r=mid-1;
            }
            #ifdef  debug
             printf("(%d)\n",tmp);
            #endif
            if(tmp==n-1)
                printf("%I64d\n",t*b[tmp]);
            else
                printf("%I64d\n",min((ULL)t*b[tmp],sum[tmp+1]));
        }
    }
    return 0;
}
/**
3
3 33
0 4 5 3 10 1
**/