Submission #2448724

---

Source Code Expand

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <bitset>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define li        long long int
#define rep(i,to) for(li i=0;i<((li)(to));++i)
#define pb        push_back
#define sz(v)     ((li)(v).size())
#define bit(n)    (1ll<<(li)(n))
#define all(vec)  (vec).begin(),(vec).end()
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define MP        make_pair
#define F         first
#define S         second
 
 
 
#define MAX 2050
#define GETA 1050
li holi[MAX][MAX];
li diag[MAX][MAX];
li mp[MAX][MAX];
 
void setHoli(li x, li y, li a){ holi[min(MAX - 1ll, max(0ll, x))][min(MAX - 1ll, max(0ll, y))] += a; }
void setDiag(li x, li y, li a){ diag[min(MAX - 1ll, max(0ll, x))][min(MAX - 1ll, max(0ll, y))] += a; }
 
void add(li x, li y, li n, li a)
{
	setHoli(x - n + 1, y - n + 1, a);
	setHoli(x - n + 1, y + 1, -a);
	setDiag(x - n + 2, y + 1, a);
	setDiag(x + 1, y + n, -a);
	setDiag(x + 1, y - n + 1, -a);
	setDiag(x + n + 1, y + 1, a);
	setHoli(x + n, y + 1, -a);
	setHoli(x + n, y + n, a);
}
 
 
int main()
{
	li N;
	cin >> N;
	rep(i, N){
		li t, x, y, n;
		cin >> t >> x >> y >> n; y = -y;
		if(t == 1) add(x + GETA, y + GETA, n, 1);
		if(t == 2) rep(d, n) add(x + GETA, y + GETA, d + 1, 1);
		if(t == 3) rep(d, n) add(x + GETA, y + GETA, d + 1, (n - d) * (n - d) - (n - d - 1) * (n - d - 1));
	}
	
	rep(i, MAX)rep(j, MAX)if(j + 1 < MAX) holi[i][j + 1] += holi[i][j];
	rep(i, MAX)rep(j, MAX)if(i + 1 < MAX && j + 1 < MAX) diag[i + 1][j + 1] += diag[i][j];
	
	rep(i, MAX)rep(j, MAX){
		if(0 < i) mp[i][j] += mp[i - 1][j];
		mp[i][j] += holi[i][j];
		mp[i][j] += diag[i][j];
	}
	
	li res = 0;
	rep(i, MAX)rep(j, MAX) res = max(res, mp[i][j]);
	cout << res << endl;
}

Submission Info

Judge Result