2018 ICPC shenyang G题

现场赛两个队友写了一句memset(arr, 0, sizeof(arr))// arr -> 6000 * 6000。于是我们自闭了3个小时。今天总算是在Gym上面把题补了，真的是巨感动。

#include<iostream>
#include<algorithm>
#include<set>
#include<utility>
#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e3;
const int maxm = 1e7;
vector<int> A[maxm + 5];
set<pii> s;
int t, op, k, w, n, m, cas;
ll res, arr[maxn + 5][maxn + 5], x, y;
void Init(){
    int up = sqrt(maxm);
    for(int i = 1; i <= up + 1; ++i){
        for(int j = i + 1; i * i + j * j <= maxm; ++j){
            int k = i * i + j * j;
            A[k].push_back(i);
        }
    }
}
void Clear(){
    res = 0;
    for(auto iter = s.begin(); iter != s.end(); ++iter){
        x = iter->first, y = iter->second;
        arr[x][y] = 0;
    }
    s.clear();
}
void Modify(){
    x = (x + res) % maxn + 1;
    y = (y + res) % maxn + 1;
}
void Increase(){
    int k1 = sqrt(k), k2 = sqrt(k / 2);
    ll u = x, v = y;
    if(k == 0){
        arr[u][v] += w;
        return;
    }
    if(k1 * k1 == k){
        u = x + k1, v = y;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - k1, v = y;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x, v = y + k1;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x, v = y - k1;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
    }
    if(2 * k2 * k2 == k){
        u = x + k2, v = y + k2;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x + k2, v = y - k2;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - k2, v = y + k2;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - k2, v = y - k2;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
    }
    for(int i = 0; i < A[k].size(); ++i){
        int a = A[k][i];
        int b = sqrt(k - a * a);
        u = x + a; v = y + b;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x + a; v = y - b;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - a; v = y + b;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - a; v = y - b;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x + b; v = y + a;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x + b; v = y - a;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - b; v = y + a;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
        u = x - b; v = y - a;
        if(s.find(pii(u, v)) != s.end())arr[u][v] += w;
    }
}
void Cal(){
    res = 0;
    int k1 = sqrt(k), k2 = sqrt(k / 2), u = x, v = y;
    if(k == 0){
        res = arr[u][v];
        return;
    }
    if(k1 * k1 == k){
        u = x + k1, v = y;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - k1, v = y;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x, v = y + k1;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x, v = y - k1;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
    }
    if(2 * k2 * k2 == k){
        u = x + k2, v = y + k2;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x + k2, v = y - k2;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - k2, v = y + k2;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - k2, v = y - k2;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
    }
    for(int i = 0; i < A[k].size(); ++i){
        int a = A[k][i];
        int b = sqrt(k - a * a);
        u = x + a; v = y + b;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x + a; v = y - b;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - a; v = y + b;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - a; v = y - b;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x + b; v = y + a;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x + b; v = y - a;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - b; v = y + a;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
        u = x - b; v = y - a;
        if(s.find(pii(u, v)) != s.end())res += arr[u][v];
    }
}
int main(void)
{
    Init();
    scanf("%d", &t);
    while(t--){
        printf("Case #%d:\n", ++cas);
        scanf("%d %d", &n, &m);
        Clear();
        for(int i = 1; i <= n; ++i){
            scanf("%lld %lld %d", &x, &y, &w);
            s.insert(pii(x, y));
            arr[x][y] = w;
        }
        while(m--){
            scanf("%d %lld %lld", &op, &x, &y);
            Modify();
            if(op == 1){
                scanf("%d", &w);
                s.insert(pii(x, y));
                arr[x][y] = w;
            }else if(op == 2){
                s.erase(pii(x, y));
                arr[x][y] = 0;
            }else if(op == 3){
                scanf("%d %d", &k, &w);
                Increase();
            }else {
                scanf("%d", &k);
                Cal();
                printf("%lld\n", res);
            }
        }
    }
    return 0;
}