2018 ACM-ICPC, Asia Shenyang Regional G. Best ACMer Solves the Hardest Problem

传送门

G. Best ACMer Solves the Hardest Problem

题意 给出二维平面上的$n$个点, 每个点都有权值$w$。然后给出$m$次操作，一共有四种操作:加入一个权值为$w$的新点、删除一个点、将到$(x,y)$点距离为$\sqrt{k}$的点权值加$w$、求到$(x,y)$点距离为$\sqrt{k}$的点的权值和，记录为$lastans$并且输出它。以后每次输入的$x,y$都要对$lastans$取模加$1$。

题解： 按题意模拟即可，但暴力模拟会$TLE$,看了看$k$的范围，所以我们预处理一下，将$a^2+b^2=k$的值存下来。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
const int maxn = 1e7 + 10;
vector<pii>v[maxn];
map<pii, int>mp;
int n, m, cnt;
void init() {
	for(ll i = 0; i <= 4000; i++) {
		for(ll j = 0; j <= 4000; j++) {
			if(i * i + j * j > 10000000) break;
			v[i * i + j * j].pb({i, j});
		}
	}
}

void run () {
	scanf("%d %d", &n, &m);
	cnt++;
	printf("Case #%d:\n", cnt);
	mp.clear();
	ll lastans = 0;
	for(int i = 1; i <= n; i++) {
		int x, y, w;
		scanf("%d %d %d", &x, &y, &w);
		mp[{x, y}] = w;
	}
	while(m--) {
		int q, x, y, w, k;
		scanf("%d", &q);
		if(q == 1) {
			scanf("%d %d %d", &x, &y, &w);
			x = (x + lastans) % 6000 + 1;
			y = (y + lastans) % 6000 + 1;
			mp[{x, y}] = w;
		}
		if(q == 2) {
			scanf("%d %d", &x, &y);
			x = (x + lastans) % 6000 + 1;
			y = (y + lastans) % 6000 + 1;
			mp[{x, y}] = 0;
		}
		if(q == 3) {
			scanf("%d %d %d %d", &x, &y, &k, &w);
			x = (x + lastans) % 6000 + 1;
			y = (y + lastans) % 6000 + 1;
			for(auto g : v[k]) {
				if(g.fi == 0 && g.se == 0) {
					if(mp[{x, y}] != 0)
						mp[{x, y}] += w;
				}
				else if(g.fi == 0) {
					if(mp[{x, y + g.se}] != 0)
						mp[{x, y + g.se}] += w;
					if(mp[{x, y - g.se}] != 0)
						mp[{x, y - g.se}] += w;
				}
				else if(g.se == 0) {
					if(mp[{x + g.fi, y}] != 0)
						mp[{x + g.fi, y}] += w;
					if(mp[{x - g.fi, y}] != 0)
						mp[{x - g.fi, y}] += w;
				}				
				else {
					if(mp[{x + g.fi, y + g.se}] != 0)
						mp[{x + g.fi, y + g.se}] += w;
					if(mp[{x - g.fi, y - g.se}] != 0)
						mp[{x - g.fi, y - g.se}] += w;	
					if(mp[{x + g.fi, y - g.se}] != 0)
						mp[{x + g.fi, y - g.se}] += w;
					if(mp[{x - g.fi, y + g.se}] != 0)
						mp[{x - g.fi, y + g.se}] += w;				
				}
			}
		}
		if(q == 4) {
			scanf("%d %d %d", &x, &y, &k);
			x = (x + lastans) % 6000 + 1;
			y = (y + lastans) % 6000 + 1;
			ll sum = 0;
			for(auto g : v[k]) {
				if(g.fi == 0 && g.se == 0) {
					if(mp[{x, y}] != 0)
						sum += mp[{x, y}];
				}
				else if(g.fi == 0) {
					if(mp[{x, y + g.se}] != 0)
						sum += mp[{x, y + g.se}];
					if(mp[{x, y - g.se}] != 0)
						sum += mp[{x, y - g.se}];
				}
				else if(g.se == 0) {
					if(mp[{x + g.fi, y}] != 0)
						sum += mp[{x + g.fi, y}];
					if(mp[{x - g.fi, y}] != 0)
						sum += mp[{x - g.fi, y}];
				}				
				else {
					if(mp[{x + g.fi, y + g.se}] != 0)
						sum += mp[{x + g.fi, y + g.se}];
					if(mp[{x - g.fi, y - g.se}] != 0)
						sum += mp[{x - g.fi, y - g.se}];	
					if(mp[{x + g.fi, y - g.se}] != 0)
						sum += mp[{x + g.fi, y - g.se}];
					if(mp[{x - g.fi, y + g.se}] != 0)
						sum += mp[{x - g.fi, y + g.se}];				
				}
			}
			printf("%lld\n", sum);
			lastans = sum;
		}
	}
}

int main () {
	init();
	int t;
	scanf("%d", &t);
	while(t--)
		run();
	return 0;
}