HDU4970:Killing Monsters
来源:互联网 发布:dnf总网络连接中断 编辑:程序博客网 时间:2024/06/13 13:06
Problem Description
Kingdom Rush is a popular TD game, in which you should build some towers to protect your kingdom from monsters. And now another wave of monsters is coming and you need again to know whether you can get through it.
The path of monsters is a straight line, and there are N blocks on it (numbered from 1 to N continuously). Before enemies come, you have M towers built. Each tower has an attack range [L, R], meaning that it can attack all enemies in every block i, where L<=i<=R. Once a monster steps into block i, every tower whose attack range include block i will attack the monster once and only once. For example, a tower with attack range [1, 3] will attack a monster three times if the monster is alive, one in block 1, another in block 2 and the last in block 3.
A witch helps your enemies and makes every monster has its own place of appearance (the ith monster appears at block Xi). All monsters go straightly to block N.
Now that you know each monster has HP Hi and each tower has a value of attack Di, one attack will cause Di damage (decrease HP by Di). If the HP of a monster is decreased to 0 or below 0, it will die and disappear.
Your task is to calculate the number of monsters surviving from your towers so as to make a plan B.
The path of monsters is a straight line, and there are N blocks on it (numbered from 1 to N continuously). Before enemies come, you have M towers built. Each tower has an attack range [L, R], meaning that it can attack all enemies in every block i, where L<=i<=R. Once a monster steps into block i, every tower whose attack range include block i will attack the monster once and only once. For example, a tower with attack range [1, 3] will attack a monster three times if the monster is alive, one in block 1, another in block 2 and the last in block 3.
A witch helps your enemies and makes every monster has its own place of appearance (the ith monster appears at block Xi). All monsters go straightly to block N.
Now that you know each monster has HP Hi and each tower has a value of attack Di, one attack will cause Di damage (decrease HP by Di). If the HP of a monster is decreased to 0 or below 0, it will die and disappear.
Your task is to calculate the number of monsters surviving from your towers so as to make a plan B.
Input
The input contains multiple test cases.
The first line of each case is an integer N (0 < N <= 100000), the number of blocks in the path. The second line is an integer M (0 < M <= 100000), the number of towers you have. The next M lines each contain three numbers, Li, Ri, Di (1 <= Li <= Ri <= N, 0 < Di <= 1000), indicating the attack range [L, R] and the value of attack D of the ith tower. The next line is an integer K (0 < K <= 100000), the number of coming monsters. The following K lines each contain two integers Hi and Xi (0 < Hi <= 10^18, 1 <= Xi <= N) indicating the ith monster’s live point and the number of the block where the ith monster appears.
The input is terminated by N = 0.
The first line of each case is an integer N (0 < N <= 100000), the number of blocks in the path. The second line is an integer M (0 < M <= 100000), the number of towers you have. The next M lines each contain three numbers, Li, Ri, Di (1 <= Li <= Ri <= N, 0 < Di <= 1000), indicating the attack range [L, R] and the value of attack D of the ith tower. The next line is an integer K (0 < K <= 100000), the number of coming monsters. The following K lines each contain two integers Hi and Xi (0 < Hi <= 10^18, 1 <= Xi <= N) indicating the ith monster’s live point and the number of the block where the ith monster appears.
The input is terminated by N = 0.
Output
Output one line containing the number of surviving monsters.
Sample Input
521 3 15 5 251 33 15 27 39 10
Sample Output
3HintIn the sample, three monsters with origin HP 5, 7 and 9 will survive.
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define up(i,x,y) for(i=x;i<=y;i++)#define mem(a,b) memset(a,b,sizeof(a))#define w(x) while(x)#define ll __int64ll n,m,k,l,r,d,a[100005],i,ans;int main(){ w((scanf("%I64d",&n),n)) { scanf("%I64d",&k); mem(a,0); w(k--) { scanf("%I64d%I64d%I64d",&l,&r,&d); a[l]+=d,a[r+1]+=-d; } up(i,1,n) a[i]+=a[i-1]; up(i,1,n) a[i]+=a[i-1]; scanf("%I64d",&m); ans=0; w(m--) { scanf("%I64d%I64d",&l,&d); if(a[n]-a[d-1]<l) ans++; } printf("%I64d\n",ans); } return 0;}
0 0
- hdu4970 Killing Monsters
- HDU4970-Killing Monsters
- HDU4970:Killing Monsters
- HDU4970 Killing Monsters
- hdu4970-Killing Monsters
- Killing Monsters(hdu4970)
- HDU4970 Killing Monsters 【数组标记】
- hdu4970 Killing Monsters(模拟塔防游戏)
- Killing Monsters(不使用线段树)HDU4970
- HDU4970 Killing Monsters (2014多校第九场第11题)
- hdu 4970 Killing Monsters
- HDOJ 4970 Killing Monsters
- HDU - 4970 Killing Monsters
- hdu 4970 Killing Monsters
- HDU 4970 Killing Monsters
- hdu 4970 Killing Monsters
- hdu 4790 Killing Monsters
- 周赛-Killing Monsters
- sscanf()函数的用法
- 都是空格惹的祸
- SPOJ - QTREE 375 Query on a tree 树链剖分+线段树
- 不可埋葬的记忆
- 细数开源历史上的十个重大事件
- HDU4970:Killing Monsters
- 11.2RAC 启动过程
- Microsoft JET Database Engine 错误 '80004005'
- linux如何查看系统信息
- 批量写图像地址的方法
- HDU4970 Killing Monsters
- DES加密-java版
- C# Socket编程 同步以及异步通信
- listView 一个简单的Item布局