HDU 4666 Hyperspace （2013多校7 1001题 最远曼哈顿距离）

Hyperspace

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 67    Accepted Submission(s): 32

Problem Description

The great Mr.Smith has invented a hyperspace particle generator. The device is very powerful. The device can generate a hyperspace. In the hyperspace, particle may appear and disappear randomly. At the same time a great amount of energy was generated.
However, the device is in test phase, often in a unstable state. Mr.Smith worried that it may cause an explosion while testing it. The energy of the device is related to the maximum manhattan distance among particle.
Particles may appear and disappear any time. Mr.Smith wants to know the maxmium manhattan distance among particles when particle appears or disappears.

 

Input

The input contains several test cases, terminated by EOF.
In each case: In the first line, there are two integer q(number of particle appear and disappear event, ≤60000) and k(dimensions of the hyperspace that the hyperspace the device generated, ≤5). Then follows q lines. In each line, the first integer ‘od’ represents the event: od = 0 means this is an appear
event. Then follows k integer(with absolute value less then 4 × 10⁷). od = 1 means this is an disappear event. Follows a integer p represents the disappeared particle appeared in the pth event.

 

Output

Each test case should contains q lines. Each line contains a integer represents the maximum manhattan distance among paticles.

 

Sample Input

10 2
0 208 403
0 371 -180
1 2
0 1069 -192
0 418 -525
1 5
1 1
0 2754 635
0 -2491 961
0 2954 -2516

 

Sample Output

0
746
0
1456
1456
1456
0
2512
5571
8922

 

Source

2013 Multi-University Training Contest 7

 

Recommend

zhuyuanchen520

 

经典的求最远曼哈顿距离。

可以看相应的论文：2009年国家集训队武森论文

其实就是维护(1<<k)个堆的最大值和最小值。

可以参考POJ 2926

我用multiset实现的。

可以使用map或者优先队列

 /* **********************************************
 Author      : kuangbin
 Created Time: 2013/8/13 18:25:38
 File Name   : F:\2013ACM练习\2013多校7\1001.cpp
 *********************************************** */

 #include <stdio.h>
 #include <string.h>
 #include <iostream>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <set>
 #include <map>
 #include <string>
 #include <math.h>
 #include <stdlib.h>
 using namespace std;
 int a[][];
 multiset<int>mst[<<];

 int main()
 {
     //freopen("in.txt","r",stdin);
     //freopen("out.txt","w",stdout);
     int q,k;
     while(scanf("%d%d",&q,&k)==)
     {
         for(int i = ;i < (<<k);i++)
             mst[i].clear();
         int od,x;
         for(int i = ;i <= q;i++)
         {
             scanf("%d",&od);
             if(od == )
             {
                 for(int j = ;j < k;j++)
                     scanf("%d",&a[i][j]);
                 for(int j = ; j < (<<k); j++)
                 {
                     int s = ;
                     for(int t = ; t < k;t++)
                         if(j & (<<t))
                             s += a[i][t];
                         else s -= a[i][t];
                     mst[j].insert(s);
                 }
             }
             else
             {
                 scanf("%d",&x);
                 for(int j = ; j < (<<k); j++)
                 {
                     int s = ;
                     for(int t = ; t < k;t++)
                         if(j & (<<t))
                             s += a[x][t];
                         else s -= a[x][t];
                     multiset<int>::iterator it = mst[j].find(s);
                     mst[j].erase(it);
                 }
             }
             int ans = ;
             for(int j = ; j < (<<k);j++)
             {
                 multiset<int>::iterator it = mst[j].end();
                 it--;
                 int t1 = (*it);
                 it = mst[j].begin();
                 int t2 = (*it);
                 ans = max(ans,t1-t2);
             }
             printf("%d\n",ans);
         }
     }
     return ;
 }