Magical Forest
Time Limit: 24000/12000 MS (Java/Others) Memory Limit:
131072/131072 K (Java/Others)
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.
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. )
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.
1 3 3 2 1 1 1 2 2 2 5 3 1 1 1 1 2 2 1 2 3 1 1 3 2 2
Case #1: 1 2 1HintNo two fruits at the same location.
#include<cstdio>
#include<map>
using namespace std;
map<int, int> mr, mc;
map<int, map<int, int> > mp;
int main()
{
int T, n, m, k, cas = 0;
scanf("%d",&T);
while(T--) {
mr.clear();
mc.clear();
mp.clear();
scanf("%d%d%d",&n,&m,&k);
int a, b, c;
int p = 0, q = 0;
for(int i = 0; i < k; i++) {
scanf("%d%d%d",&a, &b, &c);
if(!mr[a])
mr[a] = ++p;
if(!mc[b])
mc[b] = ++q;
mp[mr[a]][mc[b]] = c;
}
int Q, type;
scanf("%d",&Q);
printf("Case #%d:\n", ++cas);
while(Q--) {
scanf("%d%d%d",&type, &a, &b);
if(type == 1) {
int tmp = mr[a];
mr[a] = mr[b];
mr[b] = tmp;
}
else if(type == 2) {
int tmp = mc[a];
mc[a] = mc[b];
mc[b] = tmp;
}
else {
printf("%d\n", mp[mr[a]][mc[b]]);
}
}
}
return 0;
}
二、map与pair结合
#include<cstdio>
#include<map>
using namespace std;
map<int, int> mr, mc;
map<pair<int, int>, int> mp;
int main()
{
int T, n, m, k, cas = 0;
scanf("%d",&T);
while(T--) {
mr.clear();
mc.clear();
mp.clear();
scanf("%d%d%d",&n,&m,&k);
int a, b, c;
int p = 0, q = 0;
for(int i = 0; i < k; i++) {
scanf("%d%d%d",&a, &b, &c);
if(!mr[a])
mr[a] = ++p;
if(!mc[b])
mc[b] = ++q;
mp[make_pair(mr[a], mc[b])] = c;
}
int Q, type;
scanf("%d",&Q);
printf("Case #%d:\n", ++cas);
while(Q--) {
scanf("%d%d%d",&type, &a, &b);
if(type == 1) {
int tmp = mr[a];
mr[a] = mr[b];
mr[b] = tmp;
}
else if(type == 2) {
int tmp = mc[a];
mc[a] = mc[b];
mc[b] = tmp;
}
else {
printf("%d\n", mp[make_pair(mr[a], mc[b])]);
}
}
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
const int N = 1e5 + 10;
struct node
{
int y;
int c;
} p[N];
vector <node> vr[N];
map<int, int> mp1, mp2;
int n, m, k;
int main()
{
int T, Q;
scanf("%d",&T);
int cnt = 0;
while(T--) {
mp1.clear();
mp2.clear();
memset(vr, 0, sizeof(vr));
printf("Case #%d:\n", ++cnt);
scanf("%d%d%d", &n, &m, &k);
int l = 0, r = 0;
for(int i = 0; i < k; i++) {
int a, b, c;
scanf("%d%d%d",&a,&b,&c);
if(mp1[a] == 0)
mp1[a] = l++;
if(mp2[b] == 0)
mp2[b] = r++;
p[i].y = mp2[b];
p[i].c = c;
vr[mp1[a]].push_back(p[i]);
}
scanf("%d",&Q);
int t, x, y;
while(Q--) {
scanf("%d%d%d",&t, &x, &y);
if(t == 1) {
int a = mp1[x];
int b = mp1[y];
mp1[x] = b;
mp1[y] = a;
}
if(t == 2) {
int a = mp2[x];
int b = mp2[y];
mp2[x] = b;
mp2[y] = a;
}
if(t == 3) {
int a = mp1[x];
int b = mp2[y];
int flag = 0;
for(int i = 0; i < vr[a].size(); i++) {
if(vr[a][i].y == b) {
flag = 1;
printf("%d\n", vr[a][i].c);
break;
}
}
if(!flag)
printf("0\n");
}
}
}
return 0;
}