POJ 2665 Trees(我的水题之路——移树,POJ100题啦!)
来源:互联网 发布:玉米 番薯 知乎 编辑:程序博客网 时间:2024/06/11 11:09
Trees
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8212 Accepted: 5461
Description
The road off the east gate of Peking University used to be decorated with a lot of trees. However, because of the construction of a subway, a lot of them are cut down or moved away. Now please help to count how many trees are left.
Let's only consider one side of the road. Assume that trees were planted every 1m (meter) from the beginning of the road. Now some sections of the road are assigned for subway station, crossover or other buildings, so trees in those sections will be moved away or cut down. Your job is to give the number of trees left.
For example, the road is 300m long and trees are planted every 1m from the beginning of the road (0m). That's to say that there used to be 301 trees on the road. Now the section from 100m to 200m is assigned for subway station, so 101 trees need to be moved away and only 200 trees are left.
Let's only consider one side of the road. Assume that trees were planted every 1m (meter) from the beginning of the road. Now some sections of the road are assigned for subway station, crossover or other buildings, so trees in those sections will be moved away or cut down. Your job is to give the number of trees left.
For example, the road is 300m long and trees are planted every 1m from the beginning of the road (0m). That's to say that there used to be 301 trees on the road. Now the section from 100m to 200m is assigned for subway station, so 101 trees need to be moved away and only 200 trees are left.
Input
There are several test cases in the input. Each case starts with an integer L (1 <= L < 2000000000) representing the length of the road and M (1 <= M <= 5000) representing the number of sections that are assigned for other use.
The following M lines each describes a section. A line is in such format:
Start End
Here Start and End (0 <= Start <= End <= L) are both non-negative integers representing the start point and the end point of the section. It is confirmed that these sections do not overlap with each other.
A case with L = 0 and M = 0 ends the input.
The following M lines each describes a section. A line is in such format:
Start End
Here Start and End (0 <= Start <= End <= L) are both non-negative integers representing the start point and the end point of the section. It is confirmed that these sections do not overlap with each other.
A case with L = 0 and M = 0 ends the input.
Output
Output the number of trees left in one line for each test case.
Sample Input
300 1100 200500 2100 200201 3000 0
Sample Output
200300
Source
Beijing 2005 Preliminary
一个L(L<2 * 10^9)长度的公路,上面每隔一米有一棵树,即这个公路上有L+1棵树。之后有M个区间的树要移除,区间为[start,end],所以每次会移除end-start+1棵树。问最后还剩下多少棵树。
用一个unsigned int储存总数,然后每次对于区间减去需要移除的数量,最后求值。
注意点:
1)unsigned int为32位,最大值为4294967296,可以存储的下。
代码(1AC, POJ100题啦 \(^o^)/):
#include <cstdio>#include <cstdlib>#include <cstring>int main(void){ unsigned int trees; int i, j; int M; unsigned int start, end; while (scanf("%u%d", &trees, &M), trees != 0 || M != 0){ trees += 1; for (i = 0; i < M ; i++){ scanf("%u%u", &start, &end); trees -= end - start + 1; } printf("%u\n", trees); } return 0;}
- POJ 2665 Trees(我的水题之路——移树,POJ100题啦!)
- POJ 2665 Trees(水~)
- POJ 2459 Feed Accounting(我的水题之路——英文题啊!!!)
- POJ 2535 Very Simple Problem(我的水题之路——看错题)
- POJ 2636 Electrical Outlets(我的水题之路——水,电器接头)
- POJ 2840 Big Clock(我的水题之路——水,钟)
- POJ 1118 Lining Up(我的水题之路——斜率最多)
- POJ 1248 Safecracker(我的水题之路——五重循环暴力- -!)
- POJ 1250 Tanning Salon(我的水题之路——字母表数组标记)
- POJ 1316 Self Numbers(我的水题之路——筛法)
- POJ 1326 Mileage Bank(我的水题之路——模拟,四舍五入)
- POJ 1450 Gridland(我的水题之路——找规律)
- POJ 1488 TEX Quotes(我的水题之路——暴水,字符转换)
- POJ 1528 Perfection(我的水题之路——因子之和)
- POJ 2027 No Brainer(我的水题之路——。。。)
- POJ 1656 Counting Black(我的水题之路——表格涂色)
- POJ 2013 Symmetric Order(我的水题之路——奇偶输出)
- POJ 2019 Cornfields(我的水题之路——多case??TLE??)
- C#.NET 加密解密:AES/DES/Base64/RSA/MD5/SHA256
- 数字认证介绍
- linux非实时任务调度CFS算法分析
- Python编程规范v2
- 数字证书百度简介
- POJ 2665 Trees(我的水题之路——移树,POJ100题啦!)
- NoSQL数据库探讨 -- 非关系型数据库
- 动态ip怎样实现远程连接计算机?
- 000
- 系统性能调优
- 3D玫瑰JS
- note for rails guide
- python 取得 linux 主目录 “~/”
- 自学篇-&于&&不同之处(六)