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] +