[백준 1236] 성 지키기

문제

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

1236번: 성 지키기

---

내가 작성한 코드

import java.io.*;
import java.util.StringTokenizer;

public class qor1236 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int sero = Integer.parseInt(st.nextToken());
        int garo = Integer.parseInt(st.nextToken());

        String[][] castle = new String[sero][garo];

        for(int i = 0; i<sero; i++){
            String[] input = br.readLine().split("");
            for(int j = 0; j<garo; j++){
                castle[i][j] = input[j];
            }
        }

        int scount = 0;
        for(int i = 0; i<sero; i++){
            boolean state = true;
            for(int j = 0; j<garo; j++){
                if(castle[i][j].equals("X")){
                    state = false;
                    break;
                }
            }

            if(state){
                scount++;
            }
        }

        int gcount = 0;
        for(int i = 0; i<garo; i++){
            boolean state = true;
            for(int j = 0; j<sero; j++){
                if(castle[j][i].equals("X")){
                    state = false;
                    break;
                }
            }

            if(state){
                gcount++;
            }
        }

        bw.write(Integer.toString(Math.max(gcount,scount)));
        bw.close();
    }
}