A Sweet Journey 【二分】
来源:互联网 发布:延边大学知乎 编辑:程序博客网 时间:2024/05/29 10:54
Master Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as a line segment of length L, is a road of swamps and flats. In the swamp, it takes A point strengths per meter for Master Di to ride; In the flats, Master Di will regain B point strengths per meter when riding. Master Di wonders:In the beginning, he needs to prepare how much minimum strengths. (Except riding all the time,Master Di has no other choice)
Input
In the first line there is an integer t (1≤t≤501≤t≤50), indicating the number of test cases.
For each test case:
The first line contains four integers, n, A, B, L.
Next n lines, each line contains two integers: Li,RiLi,Ri, which represents the interval [Li,Ri][Li,Ri] is swamp.
1≤n≤100,1≤L≤105,1≤A≤10,1≤B≤10,1≤Li
- A Sweet Journey 【二分】
- hdoj 5477 A Sweet Journey 【二分】
- 【HDU】5477---A Sweet Journey(二分)
- hdoj5477A Sweet Journey【二分】
- A Sweet Journey
- A Sweet Journey
- hdu5477 A Sweet Journey
- HDU5477 A Sweet Journey
- A Sweet Journey
- hdoj 5477 A Sweet Journey (二分查找)
- HDU 5477: A Sweet Journey
- hdu 5477 A Sweet Journey
- HDOJ5477 A Sweet Journey(模拟)
- HDU5477 A Sweet Journey 模拟
- HDU 5477 A Sweet Journey
- HDU 5477 A Sweet Journey
- HDU 5477 A Sweet Journey
- hdoj 5477 A Sweet Journey
- 单词方阵解题报告
- 【poj 3061】Subsequence 【尺取法】or【前缀和+二分】
- leetcode 51. N-Queens
- 机器人走方格I
- C++文件读写详解(ofstream,ifstream,fstream)
- A Sweet Journey 【二分】
- 访问者模式
- windows下在命令行模式下使用MinGW编译C代码,出现cannot find ipthread
- HDU 1426 Sudoku Killer(dfs)
- Spring boot简单入门学习
- 【hdu 5101】Select 【二分 +容斥思想】
- Kotlin 前言和介绍
- LeetCode 371 Sum of Two Integers
- 【poj 3258】River Hopscotch 【二分】