Submission #60240

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>

using namespace std;

typedef unsigned uint;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

const int L = 2010;

int N;
int T[10010], X[10010], Y[10010], S[10010];
Int ps[3][2020];

int main() {
	int i, d;
	int x, y, y0, y1;
	
	for (; ~scanf("%d", &N); ) {
		for (i = 0; i < N; ++i) {
			T[i] = in();
			X[i] = in() + L / 2;
			Y[i] = in() + L / 2;
			S[i] = in() - 1;
		}
		Int ans = 0;
		for (x = 0; x < L; ++x) {
			memset(ps, 0, sizeof(ps));
			for (i = 0; i < N; ++i) {
				/*
					X[i] - S[i] <= x <= X[i] + S[i]
					Y[i] - S[i] <= y <= Y[i] + S[i]
					(X[i] + Y[i]) - S[i] <= x + y <= (X[i] + Y[i]) + S[i]
				*/
				if (X[i] - S[i] <= x && x <= X[i] + S[i]) {
					y0 = max(Y[i] - S[i], (X[i] + Y[i]) - S[i] - x);
					y1 = min(Y[i] + S[i], (X[i] + Y[i]) + S[i] - x);
					if (y0 <= y1) {
						int l = y1 - y0 - S[i];
						switch (T[i]) {
							case 1: {
								ps[0][y0    ] += 1;
								ps[0][y1 + 1] -= 1;
							} break;
							case 2: {
								ps[1][y0    ] += +1;
								ps[1][y0 + l] -= +1;
								ps[0][y0    ] += -(y0 - 1);
								ps[0][y0 + l] -= -(y0 - 1);
								
								ps[0][y0 + l    ] += l + 1;
								ps[0][y1 - l + 1] -= l + 1;
								
								ps[1][y1 - l + 1] += -1;
								ps[1][y1     + 1] -= -1;
								ps[0][y1 - l + 1] += +(y1 + 1);
								ps[0][y1     + 1] -= +(y1 + 1);
							} break;
							case 3: {
								ps[2][y0    ] += 1;
								ps[2][y0 + l] -= 1;
								ps[1][y0    ] += -2 * (y0 - 1);
								ps[1][y0 + l] -= -2 * (y0 - 1);
								ps[0][y0    ] += (y0 - 1) * (y0 - 1);
								ps[0][y0 + l] -= (y0 - 1) * (y0 - 1);
								
								ps[0][y0 + l    ] += (l + 1) * (l + 1);
								ps[0][y1 - l + 1] -= (l + 1) * (l + 1);
								
								ps[2][y1 - l + 1] += 1;
								ps[2][y1     + 1] -= 1;
								ps[1][y1 - l + 1] += -2 * (y1 + 1);
								ps[1][y1     + 1] -= -2 * (y1 + 1);
								ps[0][y1 - l + 1] += (y1 + 1) * (y1 + 1);
								ps[0][y1     + 1] -= (y1 + 1) * (y1 + 1);
							} break;
							default: assert(0);
						}
					}
				}
			}
			Int now[3] = {};
			for (y = 0; y < L; ++y) {
				for (d = 0; d < 3; ++d) {
					now[d] += ps[d][y];
				}
				Int tmp = (now[2] * y + now[1]) * y + now[0];
// if(tmp)cout<<x-L/2<<" "<<y-L/2<<" : "<<tmp<<endl;
				chmax(ans, tmp);
			}
		}
		printf("%lld\n", ans);
	}
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int in()’:
./Main.cpp:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result

Judge Result