HDOJ 题目4941Magical Forest(STL)
来源:互联网 发布:风电场风速数据下载 编辑:程序博客网 时间:2024/04/29 17:44
Magical Forest
Time Limit: 24000/12000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 964 Accepted Submission(s): 435
Problem Description
There is a forest can be seen as N * M grid. In this forest, there is some magical fruits, These fruits can provide a lot of energy, Each fruit has its location(Xi, Yi) and the energy can be provided Ci.
However, the forest will make the following change sometimes:
1. Two rows of forest exchange.
2. Two columns of forest exchange.
Fortunately, two rows(columns) can exchange only if both of them contain fruits or none of them contain fruits.
Your superior attach importance to these magical fruit, he needs to know this forest information at any time, and you as his best programmer, you need to write a program in order to ask his answers quick every time.
However, the forest will make the following change sometimes:
1. Two rows of forest exchange.
2. Two columns of forest exchange.
Fortunately, two rows(columns) can exchange only if both of them contain fruits or none of them contain fruits.
Your superior attach importance to these magical fruit, he needs to know this forest information at any time, and you as his best programmer, you need to write a program in order to ask his answers quick every time.
Input
The input consists of multiple test cases.
The first line has one integer W. Indicates the case number.(1<=W<=5)
For each case, the first line has three integers N, M, K. Indicates that the forest can be seen as maps N rows, M columns, there are K fruits on the map.(1<=N, M<=2*10^9, 0<=K<=10^5)
The next K lines, each line has three integers X, Y, C, indicates that there is a fruit with C energy in X row, Y column. (0<=X<=N-1, 0<=Y<=M-1, 1<=C<=1000)
The next line has one integer T. (0<=T<=10^5)
The next T lines, each line has three integers Q, A, B.
If Q = 1 indicates that this is a map of the row switching operation, the A row and B row exchange.
If Q = 2 indicates that this is a map of the column switching operation, the A column and B column exchange.
If Q = 3 means that it is time to ask your boss for the map, asked about the situation in (A, B).
(Ensure that all given A, B are legal. )
The first line has one integer W. Indicates the case number.(1<=W<=5)
For each case, the first line has three integers N, M, K. Indicates that the forest can be seen as maps N rows, M columns, there are K fruits on the map.(1<=N, M<=2*10^9, 0<=K<=10^5)
The next K lines, each line has three integers X, Y, C, indicates that there is a fruit with C energy in X row, Y column. (0<=X<=N-1, 0<=Y<=M-1, 1<=C<=1000)
The next line has one integer T. (0<=T<=10^5)
The next T lines, each line has three integers Q, A, B.
If Q = 1 indicates that this is a map of the row switching operation, the A row and B row exchange.
If Q = 2 indicates that this is a map of the column switching operation, the A column and B column exchange.
If Q = 3 means that it is time to ask your boss for the map, asked about the situation in (A, B).
(Ensure that all given A, B are legal. )
Output
For each case, you should output "Case #C:" first, where C indicates the case number and counts from 1.
In each case, for every time the boss asked, output an integer X, if asked point have fruit, then the output is the energy of the fruit, otherwise the output is 0.
In each case, for every time the boss asked, output an integer X, if asked point have fruit, then the output is the energy of the fruit, otherwise the output is 0.
Sample Input
13 3 21 1 12 2 253 1 11 1 22 1 23 1 13 2 2
Sample Output
Case #1:121HintNo two fruits at the same location.
Author
UESTC
Source
2014 Multi-University Training Contest 7
Recommend
We have carefully selected several similar problems for you: 4984 4983 4982 4981 4980
ac代码
#include<stdio.h>#include<string.h>#include<string>#include<iostream>#include<map>using namespace std;map<int,int>mr,mc;map<pair<int,int>,int>mz;int main(){int t,cot=0;scanf("%d",&t);while(t--){int n,m,k,i,num1=0,num2=0,q;scanf("%d%d%d",&n,&m,&k);for(i=0;i<k;i++){int a,b,c;scanf("%d%d%d",&a,&b,&c);if(!mr[a])mr[a]=++num1;if(!mc[b])mc[b]=++num2;mz[make_pair(mr[a],mc[b])]=c;}printf("Case #%d:\n",++cot);scanf("%d",&q);while(q--){int m,a,b,temp;scanf("%d%d%d",&n,&a,&b);if(n==1){temp=mr[a];mr[a]=mr[b];mr[b]=temp;}else if(n==2){temp=mc[a];mc[a]=mc[b];mc[b]=temp;}else if(n==3){printf("%d\n",mz[make_pair(mr[a],mc[b])]);}}}}
0 0
- HDOJ 题目4941Magical Forest(STL)
- hdoj 4941 Magical Forest 【STL map】
- HDOJ 4941 Magical Forest
- HDOJ 4941 Magical Forest
- HDU4941-Magical Forest(STL)
- hdu 4941 Magical Forest(STL map & 结构体运用)
- hdu 4941 Magical Forest(STL之map应用)
- HDU 4941 Magical Forest --STL Map应用
- hdu 4941 Magical Forest(STL之map应用)2014多校训练第7场
- STL : map函数的运用 --- hdu 4941 : Magical Forest
- hdu 4941 Magical Forest (map容器)
- HDU-4941-Magical Forest
- HDU 4941 Magical Forest
- hdu 4941 Magical Forest
- hdu 4941 Magical Forest
- HDU - 4941 Magical Forest
- hdu 4941 Magical Forest
- HDU 4941 Magical Forest
- Cacti 模板(图形模板、数据模板、主机模板)与自定义监控脚本
- android 悬浮窗
- sed 使用小结
- cocos2d-x 3.2 如何屏蔽下层管理事件?
- 蓝牙PAN是什么
- HDOJ 题目4941Magical Forest(STL)
- 一点想法
- HDU 3081 Marriage Match II(二分+并查集+最大流)
- [ATL/WTL]_[中级]_[保存CBitmap到文件-保存屏幕内容到文件]
- Eclipse搭建SSH(Struts2+Spring3+Hibernate3)框架项目教程
- oracle 启动监听提示 :The listener supports no services
- 用GDB调试程序
- Linux core 文件介绍
- 把Matlab里求相关函数的xcorr命令彻底搞清楚