[백준]2563_색종이_Java 풀이

https://www.acmicpc.net/problem/2563

2563번: 색종이

 

 

<풀이>

• 100x100 boolean 배열 만들어서 각 칸의 개수 세는 방법으로 구현

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main_2563 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		int newX=0,newY=0,sum=0;
		boolean [][] map = new boolean[101][101]; 
		for(int i = 0;i<N;i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			newX = Integer.parseInt(st.nextToken());
			newY = Integer.parseInt(st.nextToken());
			
			for(int j=newX;j<newX+10;j++) {
				for(int k=newY;k<newY+10;k++) {
					if(map[j][k]==false) {
						map[j][k]=true;
					}
				}
			}
		}
		
		for(int i=1;i<101;i++) {
			for(int j=1;j<101;j++) {
				if(map[i][j]==true) sum++;
			}
		}
		
		System.out.println(sum);
	}
}

https://github.com/LeeJieuni/Algorithm/blob/main/BOJ/Main_2563_%EC%9D%B4%EC%A7%80%EC%9D%80.java

GitHub - LeeJieuni/Algorithm