PS/BOJ

백준 1343 폴리오미노

얍연구소장 2023. 4. 20. 22:49

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

 

 

> 풀이

 

import java.util.Scanner;

/*
 * 백준 1343 폴리오미
 * #실버5
 * #그리디
 */
public class boj_1343 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] arr = input.split("\\.");
		String[] polyomino = {"AAAA", "BB"};
		String answer = "";
		
		for(int i = 0; i < arr.length; i++) {
			String str = arr[i];
			if(str.length() % 2 != 0) {
				answer = "-1";
				break;
			} else {
				if(str.length() % 4 == 0) {
					answer += polyomino[0].repeat(str.length()/4);
				} else {
					answer += polyomino[0].repeat(str.length()/4);
					answer += polyomino[1];
				}
			}
			
			if(i != arr.length - 1) {
				answer += ".";
			}
		}
		
		if(!"-1".equals(answer) ) {
			answer += ".".repeat(input.length() - answer.length());
		}
		
		System.out.println(answer);
	}
}