hdu_4666 Hyperspace

模板题,水过 c++输入输出超时

http://acm.hdu.edu.cn/showproblem.php?pid=4666

#include <cstdio>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <fstream>
using namespace std;


//LOOP
#define FF(i, a, b) for(int i = (a); i < (b); ++i)
#define FE(i, a, b) for(int i = (a); i <= (b); ++i)
#define FED(i, b, a) for(int i = (b); i>= (a); --i)
#define REP(i, N) for(int i = 0; i < (N); ++i)
#define CLR(A,value) memset(A,value,sizeof(A))
#define FC(it, c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)


//OTHER
#define SZ(V) (int)V.size()
#define PB push_back
#define MP make_pair
#define all(x) (x).begin(),(x).end()


//INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RS(s) scanf("%s", s)


//OUTPUT
#define WI(n) printf("%d\n", n)
#define WS(n) printf("%s\n", n)


//debug
//#define online_judge
#ifndef online_judge
#define debugt(a) cout << (#a) << "=" << a << " ";
#define debugI(a) debugt(a) cout << endl
#define debugII(a, b) debugt(a) debugt(b) cout << endl
#define debugIII(a, b, c) debugt(a) debugt(b) debugt(c) cout << endl
#define debugIV(a, b, c, d) debugt(a) debugt(b) debugt(c) debugt(d) cout << endl
#else
#define debugI(v)
#define debugII(a, b)
#define debugIII(a, b, c)
#define debugIV(a, b, c, d)
#endif

typedef long long LL;
typedef unsigned long long ULL;
typedef vector <int> VI;
const int INF = 0x3f3f3f3f;
const double eps = 1e-10;
const int MOD = 100000007;
const int MAXN = 1000010;
const double PI = acos(-1.0);

struct Node
{
    int a[6], b[35];
} s[MAXN];
///结构体保存每个点的维数距离(a),处理出来的状态(b)
multiset<int> mst[35];
///mst动态维护,对每一组状态保存一个域，里面存所有点

struct Manhattan
{
    int k;
    void init()
    {
        REP(i, 1 << k)
        {
            mst[i].clear();
        }
    }
    ///work每次处理处所有的状态,add为增加一个点,del为删除一个点
    void work(int id)
    {
        REP(i, 1 << k)
        {
            int sum = 0;
            for(int j = 0; j < k; j++)
            {
                if(i & (1 << j))
                    sum += s[id].a[j];
                else
                    sum -= s[id].a[j];
            }
            s[id].b[i] = sum;
        }
    }

    void add(int id)
    {
        work(id);
        REP(i, 1 << k)
        {
            mst[i].insert(s[id].b[i]);
        }
    }

    void del(int id)
    {
        for(int i = 0; i < (1 << k); i++)
        {
            mst[i].erase(mst[i].find(s[id].b[i]));
        }
    }

    int get()
    {
        int ret = -1;
        for(int i = 0; i < (1 << k); i++)
        {
            int a = *(mst[i].rbegin());
            int b = *(mst[i].begin());
            if(a - b > ret) ret = a - b;
        }
        return ret;
    }
} mandis;


int main()
{
    int n, type, id;
    while (~RII(n, mandis.k))
    {
        mandis.init();
        FE(kase, 1, n)
        {
            RI(type);
            if (type == 0)
            {
                REP(i, mandis.k)
                    RI(s[kase].a[i]);
                mandis.add(kase);
            }
            else
            {
                RI(id);
                mandis.del(id);
            }
            WI(mandis.get());
        }
    }
    return 0;
}