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

• 問題: No.124 門松列(3)
• ユーザー: yuki2006
• 提出日時: 2015-01-10 17:55:08
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 290 ms / 5,000 ms
• コード長: 3,510 bytes
• コンパイル時間: 4,414 ms
• コンパイル使用メモリ: 82,048 KB
• 実行使用メモリ: 61,388 KB
• 最終ジャッジ日時: 2024-06-13 03:34:21
• 合計ジャッジ時間: 11,205 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
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
119
120
121
122
123
124
125
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class yukicoder123 {
    class Tuple {
        int x;
        int y;
        int[] his;
        Tuple(int x, int y, int[] his) {
            this.x = x;
            this.y = y;
            this.his = his;
        }
        boolean checkSequence(int c) {
            return isKadomatsuSequence(his[1], his[2], c);
        }
        @Override
        public String toString() {
            return "" + x + ":" + y + Arrays.toString(this.his);
        }
    }
    int[][] vec = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
    boolean isKadomatsuSequence(int a, int b, int c) {
        if (a == c) {
            return false;
        }
        return (a - b) * (b - c) < 0;
    }
    int is(boolean b) {
        return b ? 1 : 0;
    }
    public yukicoder123() {
        Scanner scanner = new Scanner(System.in);
        int W = scanner.nextInt();
        int H = scanner.nextInt();
        int[][] matrix = new int[H][W];
        int[][][][] checked = new int[H][W][10][2];
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                matrix[i][j] = scanner.nextInt();
                for (int k = 0; k < 10; k++) {
                    Arrays.fill(checked[i][j][k], Integer.MAX_VALUE);
                }
            }
        }
        LinkedList<Tuple> nextQueue = new LinkedList<>();
        LinkedList<Tuple> queue = new LinkedList<>();
        for (int i = 0; i < 10; i++) {
            Arrays.fill(checked[0][0][i], Integer.MAX_VALUE);
        }
        int start = matrix[0][0];
        if (matrix[0][0] != matrix[0][1]) {
            int flag = is(matrix[0][0] > matrix[0][1]);
            checked[0][1][start][flag] = 1;
            queue.add(new Tuple(1, 0, new int[]{0, matrix[0][0], matrix[0][1]}));
        }
        if (matrix[0][0] != matrix[1][0]) {
            int flag = is(matrix[0][0] > matrix[1][0]);
            checked[1][0][start][flag] = 1;
            queue.add(new Tuple(0, 1, new int[]{0, matrix[0][0], matrix[1][0]}));
        }
        int turn = 2;
        boolean isGoal = false;
        MAIN:
        while (queue.size() > 0) {
            while (queue.size() > 0) {
                Tuple tuple = queue.pop();
                for (int[] v : vec) {
                    int x = tuple.x + v[0];
                    int y = tuple.y + v[1];
                    if (!(0 <= x && x < W && 0 <= y && y < H)) {
                        continue;
                    }
                    if (!tuple.checkSequence(matrix[y][x])) {
                        continue;
                    }
                    int flag = is(tuple.his[2] - matrix[y][x] > 0);
                    if (checked[y][x][tuple.his[2]][flag] <= turn) {
                        continue;
                    }
                    checked[y][x][tuple.his[2]][flag] = turn;
                    if (y == H - 1 && x == W - 1) {
                        isGoal = true;
                        break MAIN;
                    }
                    nextQueue.add(new Tuple(x, y, new int[]{tuple.his[1], tuple.his[2], matrix[y][x]}));
                }
            }
            queue.addAll(nextQueue);
            nextQueue.clear();
            turn++;
        }
        if (isGoal) {
            System.out.println(turn);
        } else {
            System.out.println(-1);
        }
    }
    public static void main(String[] args) {
        yukicoder123 hoge = new yukicoder123();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX