hdu 4022 Bombing

1002 Bombing The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest

本题的思路就是将点映射一下，一次加入map，坐标值变成映射值，这样在利用静态链表进行处理，因为有可能横着炸或者竖着炸，所以结构体里加了一个标记is，防止重复统计，下面的应该很好理解了。

#include <iostream>
#include <string.h>
#include <map>
#include <stdio.h>
using namespace std;
map<int,int> mappp1,mappp2;
int n1,n2,k,k1;
int get1(int x){if (mappp1.find(x)==mappp1.end()){mappp1.insert(make_pair(x,n1));n1++;return n1-1;}else return mappp1[x];
}
int get2(int x){if (mappp2.find(x)==mappp2.end()){mappp2.insert(make_pair(x,n2));n2++;return n2-1;}else return mappp2[x];
}
int eHd[100005],eHd1[100005];
struct{int v,next;bool is;
}edge[100005],edge1[100005];
void add_edge(int u,int v){edge[k].v=v;edge[k].is=1;edge[k].next=eHd[u];eHd[u]=k++;edge1[k1].v=u;edge1[k1].is=1;edge1[k1].next=eHd1[v];eHd1[v]=k1++;
}
void init(){memset(eHd1,-1,sizeof(eHd1));memset(eHd,-1,sizeof(eHd));k=0;k1=0;n1=0;n2=0;mappp1.clear();mappp2.clear();
}
int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF&&n+m){init();for(int i=0;i<n;i++){int x,y;scanf("%d%d",&x,&y);add_edge(get1(x),get2(y));}int a,b,out;for(int mm=0;mm<m;mm++){out=0;scanf("%d%d",&a,&b);if(a==0){for(int i=eHd[get1(b)];i!=-1;i=edge[i].next){if(edge[i].is){out++;edge[i].is=0;edge1[i].is=0;}}}else{for(int i=eHd1[get2(b)];i!=-1;i=edge1[i].next){if(edge1[i].is){out++;edge[i].is=0;edge1[i].is=0;}}}printf("%d\n",out);}printf("\n");}return 0;
}

hdu 4022 Bombing相关推荐

HDU 4022 Bombing(11年上海二分)
转载请注明出处,谢谢http://blog.csdn.net/acm_cxlove/article/details/7854526 by---cxlove 题目:给出一些点,给出两个操作, ...
HDU 4022 Bombing c++解法
It's a cruel war which killed millions of people and ruined series of cities. In order to stop it, l ...
linux chown 将root改变所有者为admin,Linux用户管理权限管理内存管理网络管理命令（第四天）...
默认添加的用户会自动加入和用户名一样的组中 su 切换用户查看当前登陆的用户: whoami id` 查看当前用户属于哪个组:groups groupadd 组名添加组 groupdel 组名删 ...
HDU 4738 Caocao‘s Bridges（桥、任何位运算一定都要加括号、因为有重边所以用前向星）
HDU 4738 Caocao's Bridges(桥.任何位运算一定都要加括号.因为有重边所以用前向星) Caocao was defeated by Zhuge Liang and Zhou Yu ...
HDU 5643 King's Game 打表
King's Game 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5643 Description In order to remember hi ...
HDU 4738 Caocao's Bridges 求桥诸葛亮带着炸弹跑路了
Description Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't g ...
HDU——1106排序（istringstream的使用、STLvector练习）
排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submiss ...
hdu 5438 Ponds 拓扑排序
Ponds Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/contests/contest_showproblem ...
HDU 1248 寒冰王座(全然背包:入门题)
HDU 1248 寒冰王座(全然背包:入门题) http://acm.hdu.edu.cn/showproblem.php?pid=1248 题意: 不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票 ...

hdu 4022 Bombing

hdu 4022 Bombing相关推荐

最新文章

热门文章