Submission #62686

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int D = 2010;
		
		int[][] hc12 = new int[D][D];
		int[][] hc3h = new int[D][D];
		int[][] hc3v = new int[D][D];
		int[][] hc3d = new int[D][D];
		
		for(int i=0; i<N; i++) {
			int type = sc.nextInt();
			int x = sc.nextInt()+D/2;
			int y = sc.nextInt()+D/2;
			int size = sc.nextInt();
			
			if(type==1) {
				hc12[y+(size-1)][x-(size-1)]++;
				hc12[y+(size-2)][x-(size-2)]--;
				hc12[y-1][x-(size-1)]--;
				hc12[y-1][x-(size-2)]++;
				hc12[y-(size+1)][x+1]++;
				hc12[y-(size)][x+1]--;
				hc12[y-(size+1)][x+(size+1)]--;
				hc12[y-(size)][x+size]++;
				hc12[y-1][x+(size+1)]++;
				hc12[y-1][x+(size)]--;
				hc12[y+(size-1)][x+1]--;
				hc12[y+(size-2)][x+1]++;
			} else if(type==2) {
				hc12[y+(size-1)][x-(size-1)]++;
				hc12[y-1][x-(size-1)]--;
				hc12[y-(size+1)][x+1]++;
				hc12[y-(size+1)][x+(size+1)]--;
				hc12[y-1][x+(size+1)]++;
				hc12[y+(size-1)][x+1]--;
			} else {
				hc3v[y+(size-1)][x+1]--;
				hc3v[y+(size-2)][x+1]--;
				hc3v[y-1][x+1]+=2;
				hc3v[y-2][x+1]+=2;
				hc3v[y-(size+1)][x+1]--;
				hc3v[y-(size+2)][x+1]--;
				
				hc3h[y-1][x-(size-1)]--;
				hc3h[y-1][x-(size-2)]--;
				hc3h[y-1][x+1]+=2;
				hc3h[y-1][x+2]+=2;
				hc3h[y-1][x+(size+1)]--;
				hc3h[y-1][x+(size+2)]--;
				
				hc3d[y+(size-1)][x-(size-1)]++;
				hc3d[y+(size-2)][x-(size-2)]++;
				hc3d[y-1][x+1]-=2;
				hc3d[y-2][x+2]-=2;
				hc3d[y-(size+1)][x+(size+1)]++;
				hc3d[y-(size+2)][x+(size+2)]++;
			}
		}
		
		for(int i=D-2; i>=0; i--) {
			for(int j=1; j<D; j++) {
				hc3v[i][j] += hc3v[i+1][j];
				hc3h[i][j] += hc3h[i][j-1];
				hc3d[i][j] += hc3d[i+1][j-1];
			}
		}
		for(int i=D-1; i>=0; i--) {
			for(int j=0; j<D; j++) {
				hc12[i][j] += hc3v[i][j] + hc3h[i][j] + hc3d[i][j];
			}
		}
		for(int i=D-2; i>=0; i--) {
			for(int j=0; j<D; j++) {
				hc12[i][j] += hc12[i+1][j];
			}
		}
		for(int i=D-1; i>=0; i--) {
			for(int j=1; j<D; j++) {
				hc12[i][j] += hc12[i][j-1];
			}
		}
		for(int i=D-2; i>=0; i--) {
			for(int j=1; j<D; j++) {
				hc12[i][j] += hc12[i+1][j-1];
			}
		}
		
		int max = 0;
		for(int i=0; i<D; i++) {
			for(int j=0; j<D; j++) {
				max = Math.max(max, hc12[i][j]);
			}
		}
		System.out.println(max);
	}
}

Submission Info

Judge Result