結果

問題 No.971 いたずらっ子
ユーザー OlandOland
提出日時 2020-01-18 11:06:15
言語 Java21
(openjdk 21)
結果
AC  
実行時間 419 ms / 2,000 ms
コード長 6,953 bytes
コンパイル時間 2,201 ms
コンパイル使用メモリ 78,268 KB
実行使用メモリ 89,144 KB
最終ジャッジ日時 2024-04-25 02:06:57
合計ジャッジ時間 7,816 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 418 ms
88,924 KB
testcase_01 AC 419 ms
88,956 KB
testcase_02 AC 371 ms
73,648 KB
testcase_03 AC 394 ms
88,856 KB
testcase_04 AC 380 ms
82,620 KB
testcase_05 AC 390 ms
89,144 KB
testcase_06 AC 353 ms
77,732 KB
testcase_07 AC 98 ms
38,712 KB
testcase_08 AC 241 ms
55,948 KB
testcase_09 AC 239 ms
55,684 KB
testcase_10 AC 98 ms
38,680 KB
testcase_11 AC 49 ms
37,256 KB
testcase_12 AC 52 ms
36,820 KB
testcase_13 AC 55 ms
36,900 KB
testcase_14 AC 69 ms
38,016 KB
testcase_15 AC 54 ms
36,848 KB
testcase_16 AC 52 ms
36,784 KB
testcase_17 AC 53 ms
36,912 KB
testcase_18 AC 51 ms
37,080 KB
testcase_19 AC 51 ms
37,104 KB
testcase_20 AC 52 ms
36,876 KB
testcase_21 AC 50 ms
36,916 KB
testcase_22 AC 52 ms
36,664 KB
testcase_23 AC 50 ms
36,816 KB
testcase_24 AC 50 ms
36,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        int H = in.nextInt(), W = in.nextInt();
        char[][] a = new char[H][W];
        for(int i = 0; i < H; i++) a[i] = in.nextStr().toCharArray();
        long[][] dp = new long[H][W];
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                if(i + j == 0) continue;
                long m1 = i == 0 ? Long.MAX_VALUE : dp[i-1][j];
                long m2 = j == 0 ? Long.MAX_VALUE : dp[i][j-1];
                dp[i][j] = Math.min(m1, m2) + ((a[i][j] == 'k') ? (i + j + 1) : 1);
            }
        }
        out.println(dp[H-1][W-1]);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0