알고리즘 문제풀이

백준2563-색종이 java

제로펩시콜라 2022. 2. 26. 16:51
728x90
package A0209;

import java.util.*;

public class 색종이2563 {
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		
		int num = sc.nextInt();
		int[][] arr = new int[100][100];
		
		for(int tc=1; tc<=num; tc++) {
			int lx = sc.nextInt();
			int ly = sc.nextInt();
			int rx = lx+10;
			int ry = ly+10;
			
			for(int i=lx; i<rx; i++) {
				for(int j=ly; j<ry; j++) {
					arr[i][j]++;
				}
			}
		}
		
		int sum = 0;
		for(int i=0; i<100; i++) {
			for(int j=0; j<100; j++) {
				if(arr[i][j]!=0)sum++;
			}
		}
		System.out.println(sum);
	}
}