UVA12321 Gas Stations【贪心】

G gas stations are authorized to operate over a road of length L. Each gas station is able to sell fuel over a specific area of influence, defined as the closed interval [x − r, x + r], where x is the station’s location on the road (0 ≤ x ≤ L) and r is its radius of coverage (0 < r ≤ L). The points covered by a gas station are those within its radius of coverage.
It is clear that the areas of influence may interfere, causing disputes among the corresponding gas stations. It seems to be better to close some stations, trying to minimize such interferences without reducing the service availability along the road.
The owners have agreed to close some gas stations in order to avoid as many disputes as possible. You have been hired to write a program to determine the maximum number of gas stations that may be closed, so that every point on the road is in the area of influence of some remaining station. By the way, if some point on the road is not covered by any gas station, you must acknowledge the situation and inform about it.
Input
The input consists of several test cases. The first line of each test case contains two integer numbers L and G (separated by a blank), representing the length of the road and the number of gas stations, respectively (1 ≤ L ≤ 10⁸, 1 ≤ G ≤ 10⁴). Each one of the next G lines contains two integer numbers x_i and r_i (separated by a blank) where x_i is the location and r_i is the radius of coverage of the i-th gas station (0 ≤ x_i ≤ L, 0 < r_i ≤ L). The last test case is followed by a line containing two zeros.
Output
For each test case, print a line with the maximum number of gas stations that can be eliminated, so that every point on the road belongs to the area of influence of some not closed station. If some point on the road is not covered by any of the initial G gas stations, print ‘-1’ as the answer for such a case.
Sample Input
40 3
5 5
20 10
40 10
40 5
5 5
11 8
20 10
30 3
40 10
40 5
0 10
10 10
20 10
30 10
40 10
40 3
10 10
18 10
25 10
40 3
10 10
18 10
25 15
0 0
Sample Output
0
2
3
-1
1

问题链接：UVA12321 Gas Stations
问题简述：（略）
问题分析：贪心问题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA12321 Gas Stations */#include <bits/stdc++.h>using namespace std;const int N = 10000;
pair<int, int> p[N];int main()
{int l, g;while (~scanf("%d%d", &l, &g) && (l || g)) {for (int i = 0; i < g; i++) {int x, r;scanf("%d%d", &x, &r);p[i] = make_pair(x - r, x + r);}sort(p, p + g);int ans = g, last = 0, k = 0;for (;;) {int maxs = last, flag = 0;while (k < g) {if (p[k].first <= last) {if (p[k].second > last) {maxs = max(maxs, p[k].second);flag = 1;}k++;} elsebreak;}ans -= flag;if ((last = maxs) >= l) break;if (flag == 0) {ans = -1;break;}}printf("%d\n", ans);}return 0;
}

UVA12321 Gas Stations【贪心】相关推荐

Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
134. Gas Station加油站
［抄题］: There are N gas stations along a circular route, where the amount of gas at station i is gas[i ...
codeUp 2031 To fill or not to fill 复杂贪心
2031: To Fill or Not to Fill 时间限制: 1 Sec 内存限制: 32 MB 提交: 599 解决: 132 With highways available, driv ...
Leetcode 774. Minimize Max Distance to Gas Station
LWC 69: 774. Minimize Max Distance to Gas Station 传送门:774. Minimize Max Distance to Gas Station Prob ...
LWC 69: 774. Minimize Max Distance to Gas Station
LWC 69: 774. Minimize Max Distance to Gas Station 传送门:774. Minimize Max Distance to Gas Station Prob ...
加油python_力扣——gas station （加油站） python实现
题目描述: 中文: 在一条环路上有 N 个加油站,其中第 i 个加油站有汽油 gas[i] 升. 你有一辆油箱容量无限的的汽车,从第 i 个加油站开往第 i+1 个加油站需要消耗汽油 cost[i] ...
九度OJ 1437 To Fill or Not to Fill -- 贪心算法
题目地址:http://ac.jobdu.com/problem.php?pid=1437 题目描述: With highways available, driving a car from Hang ...
pat 甲级 1072. Gas Station (30)
1072. Gas Station (30) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A gas sta ...
LeetCode 134.Gas Station 解题分析
题目来源: https://leetcode.com/problems/gas-station/description/ 题目描述: There are N gas stations along a ...

UVA12321 Gas Stations【贪心】

UVA12321 Gas Stations【贪心】相关推荐

最新文章

热门文章