[알고리즘/백준] #10163 색종이

문제) 색종이

package IM_study.colorpaper;

import java.util.Scanner;

public class BJ_10163 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		int N = sc.nextInt();
		int[][] map = new int[1001][1001];
		int[][] paper = new int[N+1][4];
		for(int i=1;i<=N;i++) {
			for(int j=0;j<4;j++) {
				paper[i][j]=sc.nextInt();
			}
		}
		for(int i=1;i<=N;i++) {
			for(int r=paper[i][0];r<paper[i][0]+paper[i][2];r++) {
				for(int c =paper[i][1];c<paper[i][1]+paper[i][3];c++) {
					map[r][c]=i;
				}
			}
		}
		for(int a=1;a<=N;a++) {
			int cnt=0;
			for(int i=0;i<1001;i++) {
				for(int j=0;j<1001;j++) {
					if(map[i][j]==a) cnt++;
				}
			}
			sb.append(cnt).append("\n");
		}
		System.out.print(sb.toString());
	}
}