hdu 4022 Bombing
Bombing
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 2650 Accepted Submission(s):
990
ruined series of cities. In order to stop it, let’s bomb the opponent’s
base.
It seems not to be a hard work in circumstances of street battles,
however, you’ll be encountered a much more difficult instance: recounting
exploits of the military. In the bombing action, the commander will dispatch a
group of bombers with weapons having the huge destructive power to destroy all
the targets in a line. Thanks to the outstanding work of our spy, the positions
of all opponents’ bases had been detected and marked on the map, consequently,
the bombing plan will be sent to you.
Specifically, the map is expressed as a
2D-plane with some positions of enemy’s bases marked on. The bombers are
dispatched orderly and each of them will bomb a vertical or horizontal line on
the map. Then your commanded wants you to report that how many bases will be
destroyed by each bomber. Notice that a ruined base will not be taken into
account when calculating the exploits of later bombers.
non-negative integer N (N<=100,000) and M (M<=100,000) denoting the number
of target bases and the number of scheduled bombers respectively. In the
following N line, there is a pair of integers x and y separated by single space
indicating the coordinate of position of each opponent’s base. The following M
lines describe the bombers, each of them contains two integers c and d where c
is 0 or 1 and d is an integer with absolute value no more than 109,
if c = 0, then this bomber will bomb the line x = d, otherwise y = d. The input
will end when N = M = 0 and the number of test cases is no more than
50.
contains a single integer denoting the number of bases that were destroyed by
the corresponding bomber in the input. Output a blank line after each test
case.
1 2
1 3
2 3
0 1
1 3
0 0
1
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include <algorithm>
using namespace std; int main(){
int N,M,i,j,x,y;
while(scanf("%d%d",&N,&M)&&(N||M)){
map<int,multiset<int> > row;
map<int,multiset<int> > col;
for(i=;i<N;i++){
scanf("%d%d",&x,&y);
row[x].insert(y);
col[y].insert(x);
}
for(i=;i<M;i++){
scanf("%d%d",&x,&y);
int ans=;
if(x==){
printf("%d\n",row[y].size());
for(multiset<int>::iterator itr=row[y].begin();itr!=row[y].end();itr++){
col[*itr].erase(y);
}
row[y].clear();
}else{
printf("%d\n",col[y].size());
for(multiset<int>::iterator itr=col[y].begin();itr!=col[y].end();itr++){
row[*itr].erase(y);
}
col[y].clear(); } }
puts(""); } return ;
}
hdu 4022 Bombing的更多相关文章
- HDU 4022 Bombing(stl,map,multiset,iterater遍历)
题目 参考了 1 2 #define _CRT_SECURE_NO_WARNINGS //用的是STL中的map 和 multiset 来做的,代码写起来比较简洁,也比较好容易理解. ...
- HDU 4022 Bombing (map + multiset)
题意: 在x,y坐标范围为10 ^ -9 ~~ 10 ^ 9的坐标轴之中,有 10W个点(注意有些点可能在同一坐标上),然后有10W个询问,处理询问按照输入顺序处理,对于每个询问a,b a == ...
- HDU 4022 Bombing STL 模拟题
人工模拟.. #include<stdio.h> #include<iostream> #include<algorithm> #include<vector ...
- hdu 4022 Bombing(map,multiset)
题意:n个基地放在2维平面,然后m个炸弹人,每个炸弹人可以炸一行或者一列,输出每个炸弹人炸掉的基地个数. 思路:用map<int,multiset<int> >对应起来一行或者 ...
- Bombing HDU, 4022(QQ糖的消法)
Bombing From:HDU, 4022 Submit Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 ...
- hdu 4022 STL
题意:给你n个敌人的坐标,再给你m个炸弹和爆炸方向,每个炸弹可以炸横排或竖排的敌人,问你每个炸弹能炸死多少个人. /* HDU 4022 G++ 1296ms */ #include<stdio ...
- hdu 5290 Bombing plan
http://acm.hdu.edu.cn/showproblem.php?pid=5290 题意: 一棵树,每个点有一个权值wi,选择点i即可破坏所有距离点i<=wi的点,问破坏所有点 最少需 ...
- HDU 4022 stl multiset
orz kss太腻害了. 一.set和multiset基础 set和multiset会根据特定的排序准则,自动将元素进行排序.不同的是后者允许元素重复而前者不允许. 需要包含头文件: #include ...
- 2015 Multi-University Training Contest 1 hdu 5290 Bombing plan
Bombing plan Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)To ...
随机推荐
- eShopOnContainers 看微服务 ②:配置 启动
一.什么是docker Docker 是一个开源项目,通过把应用程序打包为可移植的.自给自足的容器(可以运行在云端或本地)的方式,实现应用程序的自动化部署. 使用 Docker 的时候,需要创建一个应 ...
- linux redis 启动 overcommit_memory
Redis在启动时不成功, 查看日志发现如下警告: WARNING overcommit_memory is set to 0! Background save may fail under low ...
- QTP 学习 - 检查点
- ES6原生Class
es5 之前定义构造函数的方法 // 先定义一个函数,强行叫它构造函数,大写的P也不是必须的,只是约定俗成 function Point(x, y) { this.x = x; // 构造函数的属性都 ...
- mvc中view与controll之间传递参数时,可以使用url进行传递
mvc中view与controller之间传递参数时,可以使用url进行传递,但是在url的地址中需要加上“id=123”这样的东西才行. 具体如代码: window.location.href = ...
- 译:SOS_SCHEDULER_YIELD类型等待在虚拟机环境中的增多
原文出处:Increased SOS_SCHEDULER_YIELD waits on virtual machines 注: 原文的用词是Increased,想译作增强(增长),或者加强,这么译起来 ...
- html css col-md-offset
有的时候,我们不想让两个相邻的列挨在一起,这时候利用栅格系统的列偏移(offset)功能来实现,而不必再定义margin值.使用.col-md-offset-*形式的样式就可以将列偏移到右侧.例如,. ...
- 利用CSS3实现透明边框和多重边框
使用background-clip属性实现透明边框 .bordertest { border: 30px solid hsla(0,0%,90%,.5); background: #bbb; back ...
- DJango 基础 (1)
django基础 知识点: 基本认知 工具准备 新建项目 目录及文件说明 开发服务器 创建视图函数 新建应用(app) 1.基本认知 Django是用Python开发的一个免费开源的Web框架,可以用 ...
- VMware12上安装CentOS7无法上网问题
常安装使用VMware的搭建集群环境,VMare安装后虚拟机默认的是自动获取IP,有时候用的过程中突然XSHELL中断或者需要固定IP上网,遇到几次居然,但忘了步骤,总结一下,省的每次去找资料 环境配 ...