[SWEA] 1210 Ladder1 (JAVA)

SW Expert Academy

 

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

public class Solution {

	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		int[] dc = { 0, -1, 1 };
		
		for (int testCase = 1; testCase <= 10; testCase++) {

			br.readLine();
			int[][] arr = new int[100][102];
			
			for (int row = 0; row < 100; row++) {

				String str = br.readLine();
				StringTokenizer st = new StringTokenizer(str, " ");
				
				for (int col = 1; col < 101; col++) {
					
					arr[row][col] = Integer.parseInt(st.nextToken());
					
				}
				
			}
			
			/* 2 먼저 찾고 i, j에 위치 저장 */
			int i = 99;
			int j = -1;
			for (int col = 1; col < 101; col++) {
				
				if(arr[99][col] == 2) {
					
					j = col;
					
				}
				
			}
			
			int direction = 0;	// 0 위 1 왼 2 오른
			
			while(i != 0) {
				
				if(direction == 1 || direction == 2) {
					
					j += dc[direction];
					
					if(arr[i - 1][j] == 1) {
						
						direction = 0;
						
					}
					
				} else {	// 위로 갈 때
					
					i--;
					
					if(arr[i][j - 1] == 1) {
						
						direction = 1;
						
					} else if(arr[i][j + 1] == 1) {
						
						direction = 2;
						
					}
					
				}
				
			}
			
			sb.append("#").append(testCase).append(" ").append(j - 1).append("\n");
			
		}
		
		System.out.println(sb);
		
	}
	
}