#658635 (Java) No.124 門松列(3)

• 問題: No.124 門松列(3)
• ユーザー: tenten
• 提出日時: 2021-05-19 17:45:42
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 144 ms / 5,000 ms
• コード長: 3,557 bytes
• コンパイル時間: 3,805 ms
• コンパイル使用メモリ: 88,132 KB
• 実行使用メモリ: 47,016 KB
• 最終ジャッジ日時: 2024-10-09 21:42:17
• 合計ジャッジ時間: 6,655 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 26

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int w = sc.nextInt();
        int h = sc.nextInt();
        int[][] field = new int[h][w];
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                field[i][j] = sc.nextInt();
            }
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        int[][][][] costs = new int[10][10][h][w];
        for (int[][][] arr1 : costs) {
            for (int[][] arr2 : arr1) {
                for (int[] arr3 : arr2) {
                    Arrays.fill(arr3, Integer.MAX_VALUE);
                }
            }
        }
        queue.add(new Path(0, 0, 0, 0, 0));
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (!isKadomatsu(p.prepre, p.pre, field[p.r][p.c]) || costs[p.prepre][p.pre][p.r][p.c] <= p.value) {
                continue;
            }
            costs[p.prepre][p.pre][p.r][p.c] = p.value;
            if (p.r > 0) {
                queue.add(new Path(p.r - 1, p.c, p.value + 1, p.pre, field[p.r][p.c]));
            }
            if (p.r < h - 1) {
                queue.add(new Path(p.r + 1, p.c, p.value + 1, p.pre, field[p.r][p.c]));
            }
            if (p.c > 0) {
                queue.add(new Path(p.r, p.c - 1, p.value + 1, p.pre, field[p.r][p.c]));
            }
            if (p.c < w - 1) {
                queue.add(new Path(p.r, p.c + 1, p.value + 1, p.pre, field[p.r][p.c]));
            }
        }
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                min = Math.min(min, costs[i][j][h - 1][w - 1]);
            }
        }
        if (min == Integer.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(min);
        }
    }
    
    static boolean isKadomatsu(int prepre, int pre, int cur) {
        if (pre == 0) {
            return true;
        } else if (prepre == 0) {
            return pre != cur;
        } else {
            return prepre != cur && ((prepre < pre && pre > cur) || (prepre > pre && pre < cur));
        }
    }
    
    static class Path implements Comparable<Path> {
        int r;
        int c;
        int value;
        int prepre;
        int pre;
        
        public Path(int r, int c, int value, int prepre, int pre) {
            this.r = r;
            this.c = c;
            this.value = value;
            this.prepre = prepre;
            this.pre = pre;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
        
        public String toString() {
            return r + ":" + c + ":" + value + ":" + prepre + ":" + pre;
        }
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX