Submission #65722

---

Source Code Expand

#include <cstdlib>
#include <cstring>
#include <memory>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <cmath>
#include <string>
#include <sstream>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <sys/time.h>

#define DEBUG
#ifdef DEBUG
#define DBG(...) cerr << #__VA_ARGS__ << ": " << __VA_ARGS__ << endl
#define DV(...) cerr << __VA_ARGS__ << endl
#define _D(fmt, ...) printf("%10s %3d : " fmt,__FUNCTION__,__LINE__,__VA_ARGS__)
#define _DE(fmt, ...) fprintf(stderr, "%10s %3d : " fmt,__FUNCTION__,__LINE__,__VA_ARGS__)
#else
#define DBG(...)
#define DV(...)
#define _D(fmt, ...)
#define _DE(fmt, ...)
#endif

typedef signed long long ll;
typedef unsigned long long ull;

#define _PE(...) { printf(__VA_ARGS__); fprintf(stderr, __VA_ARGS__); }
#define _E(...) fprintf(stderr, __VA_ARGS__)
#undef _P
#define _P(...) printf(__VA_ARGS__)

#define FOR(x,to) for(x=0;x<to;x++)
#define FOR2(x,from,to) for(x=from;x<to;x++)
#define ZERO(a) memset(a,0,sizeof(a))
void _fill_int(int* p,int val,int rep) {int i;	FOR(i,rep) p[i]=val;}
#define FILL_INT(a,val) _fill_int((int*)a,val,sizeof(a)/4)
#define ZERO2(a,b) memset(a,0,b)
#define MINUS(a) _fill_int((int*)a,-1,sizeof(a)/4)
#define GETs(x) scanf("%s",x);
ll GETi() { ll i;scanf("%lld",&i); return i;}
#define GET1(x) scanf("%d",x);
#define GET2(x,y) scanf("%d%d",x,y);
#define GET3(x,y,z) scanf("%d%d%d",x,y,z);

#define EPS (1e-11)
template <class T> T sqr(T val){ return val*val;}

//-------------------------------------------------------

int N;
ll types[5][2002][2002];

void solve() {
	int t,x,y,z,i,j,r,k,TM;
	int tx,ty,dy;
	ll res,p,tp;
	
	N=GETi();
	ZERO(types);
	FOR(i,N) {
		t=GETi();
		x=GETi()+1000;
		y=GETi()+1000;
		r=GETi();
		if(t==1) {
			types[0][x-r+1][y]++;		types[0][x-r+2][y]--;
			types[0][x+r][y]++;			types[0][x+r+1][y]--;
			types[0][x+1][y+r]++;		types[0][x+1][y+r-1]--;
			types[0][x-r+2][y+r-1]++;	types[0][x-r+1][y+r]--;
			types[0][x+r+1][y-r]++;		types[0][x+r][y-r+1]--;
			types[0][x+1][y-r+1]++;		types[0][x+1][y-r]--;
		}
		else if(t==2) {
			types[0][x-r+1][y]++;		types[0][x+r+1][y]--;
			types[0][x+1][y+r]++;		types[0][x+1][y-r]--;
			types[0][x+r+1][y-r]++;		types[0][x-r+1][y+r]--;
		}
		else if(t==3) {
			for(j=1;r>0;r--,j+=2) {
				types[0][x-r+1][y]+=j;		types[0][x-r+2][y]-=j;
				types[0][x+r][y]+=j;			types[0][x+r+1][y]-=j;
				types[0][x+1][y+r]+=j;		types[0][x+1][y+r-1]-=j;
				types[0][x-r+2][y+r-1]+=j;	types[0][x-r+1][y+r]-=j;
				types[0][x+r+1][y-r]+=j;		types[0][x+r][y-r+1]-=j;
				types[0][x+1][y-r+1]+=j;		types[0][x+1][y-r]-=j;
			}
		
			//右
			types[2][x-r+1][y]++;
			types[2][x-r+2][y]++;
			types[2][x+1][y]-=2;
			types[2][x+2][y]-=2;
			types[2][x+r+1][y]++;
			types[2][x+r+2][y]++;
			//右上
			types[3][x+1][y-r]--;
			types[3][x+1][y-r+1]--;
			types[3][x+1][y]+=2;
			types[3][x+1][y+1]+=2;
			types[3][x+1][y+r]--;
			types[3][x+1][y+r-1]--;
			//右下
			types[4][x+1-r][y+r]--;
			types[4][x+2-r][y+r-1]--;
			types[4][x+1][y]+=2;
			types[4][x+2][y-1]+=2;
			types[4][x+r+1][y-r]--;
			types[4][x+r+2][y-r-1]--;
		}
	}
	
	// 右上に累積
	/*
	FOR(x,2001) {
		p=0;
		FOR(y,2001) types[0][x][y]+=(p+=types[3][x][y]);
	}
	//右下に累積
	FOR(r,4001) {
		p=0;
		if(r<=2000) for(x=0,y=r;y>=0;y--,x++) types[0][x][y]+=(p+=types[4][x][y]);
		else for(x=r-2000,y=2000;x<=2000;y--,x++) types[0][x][y]+=(p+=types[4][x][y]);
	}
	//右に累積
	FOR(y,2001) {
		p=0;
		FOR(x,2001) types[0][x][y]+=(p+=types[2][x][y]);
	}
	*/
	
	// 右上に累積
	FOR(x,2001) {
		p=0;
		FOR(y,2001) types[1][x][y]=(p+=types[0][x][y]);
	}
	
	// 右下に累積
	FOR(r,4001) {
		p=0;
		if(r<=2000) for(x=0,y=r;y>=0;y--,x++) types[0][x][y]=(p+=types[1][x][y]);
		else for(x=r-2000,y=2000;x<=2000;y--,x++) types[0][x][y]=(p+=types[1][x][y]);
	}
	//右に累積
	res=0;
	FOR(y,2001) {
		p=0;
		FOR(x,2001) res=max(res,types[1][x][y]=(p+=types[0][x][y]));
	}
	
	_P("%lld\n",res);
	return;
}

int main(int argc,char** argv){
	long long span;
	struct timeval start,end,ts;
	
	if(argc>1) {
		freopen(argv[1], "r", stdin);
	}
	
	gettimeofday(&start,NULL);
	solve();
	gettimeofday(&end,NULL);
	
	span = (end.tv_sec - start.tv_sec)*1000000LL + (end.tv_usec - start.tv_usec);
	//_E("**Total time: %lld ms\n",span/1000);
	
	return 0;
	
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:172:31: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp: In function ‘ll GETi()’:
./Main.cpp:53:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result