Submission #62729

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#define REP(i,m) for(int i=0;i<m;++i)
#define REPN(i,m,in) for(int i=in;i<m;++i)
#define ALL(t) (t).begin(),(t).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
using namespace std;
static const int INF =500000000; 
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
typedef long long int lint;
typedef pair<int,int> pi;
int sum[2][2015][2015],val[2015][2015];
int n;
void fill(int x,int y,int s,int c){
	y-=s-1;
	sum[0][y][x]+=c;
	sum[0][y][x+s]-=c;
	sum[1][y+1][x-1]+=c;
	sum[1][y+s][x-s]-=c;

	y+=(s-1)*2+1;

	sum[1][y][x]+=c;
	sum[1][y-s+1][x+s-1]-=c;
	sum[0][y][x+1]+=c;
	sum[0][y][x+1-s]-=c;
}
int main(){
	cin>>n;
	REP(i,n){
		int t,x,y,s;cin>>t>>x>>y>>s;
		x+=1005;y+=1005;
		if(t==1){
			fill(x,y,s,1);
		}else if(t==2){
			for(int j=1;j<=s;++j){
				fill(x,y,j,1);
			}
		}else{
			for(int j=1;j<=s;++j) fill(x,y,j,(s-j)*2+1);
		}
	}
	REP(i,2010) REP(j,2010){
		val[i][j]=sum[0][i][j]+sum[1][i][j];
		sum[0][i][j+1]+=sum[0][i][j];
		if(j>0) sum[1][i+1][j-1]+=sum[1][i][j];
	}
	int res=0;
	REP(i,2010) REP(j,2010) if(val[i][j]){
		val[i+1][j]+=val[i][j];
		res=max(res,val[i][j]);
	}
	cout<<res<<endl;

	return 0;
}

Submission Info

Judge Result