#348687 (Java) No.832 麻雀修行中

• 問題: No.832 麻雀修行中
• ユーザー: ks2m
• 提出日時: 2019-05-24 22:57:05
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 133 ms / 2,000 ms
• コード長: 2,553 bytes
• コンパイル時間: 2,129 ms
• コンパイル使用メモリ: 79,296 KB
• 実行使用メモリ: 41,608 KB
• 最終ジャッジ日時: 2024-09-17 11:49:51
• 合計ジャッジ時間: 6,700 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 6
other	AC * 25

ソースコード

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
126
127
128
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        sc.close();
        int[] cnt = new int[9];
        for (int i = 0; i < s.length(); i++) {
            cnt[s.charAt(i) - '1']++;
        }
        TreeSet<Integer> ans = new TreeSet<Integer>();
        // 七対子
        int one = 0;
        int two = 0;
        int idx = 0;
        for (int i = 0; i < cnt.length; i++) {
            if (cnt[i] == 1) {
                one++;
                idx = i;
            } else if (cnt[i] == 2) {
                two++;
            }
        }
        if (one == 1 && two == 6) {
            ans.add(idx);
        }
        int[] work = new int[9];
        for (int i = 0; i < 9; i++) {
            // 単騎
            System.arraycopy(cnt, 0, work, 0, cnt.length);
            if (work[i] > 0) {
                work[i]--;
                if (threes(work) && cnt[i] < 4) {
                    ans.add(i);
                }
            }
            // シャンポン
            System.arraycopy(cnt, 0, work, 0, cnt.length);
            if (work[i] > 1) {
                for (int j = i + 1; j < 9; j++) {
                    System.arraycopy(cnt, 0, work, 0, cnt.length);
                    if (work[j] > 1) {
                        work[i] -= 2;
                        work[j] -= 2;
                        if (threes(work)) {
                            if (cnt[i] < 4) ans.add(i);
                            if (cnt[j] < 4) ans.add(j);
                        }
                    }
                }
            }
            // カンチャン
            System.arraycopy(cnt, 0, work, 0, cnt.length);
            if (i < 7 && work[i] > 0 && work[i + 2] > 0) {
                for (int j = 0; j < 9; j++) {
                    System.arraycopy(cnt, 0, work, 0, cnt.length);
                    work[i]--;
                    work[i + 2]--;
                    if (work[j] > 1) {
                        work[j] -= 2;
                        if (threes(work) && cnt[i + 1] < 4) {
                            ans.add(i + 1);
                        }
                    }
                }
            }
            // 両面、ペンチャン
            System.arraycopy(cnt, 0, work, 0, cnt.length);
            if (i < 8 && work[i] > 0 && work[i + 1] > 0) {
                for (int j = 0; j < 9; j++) {
                    System.arraycopy(cnt, 0, work, 0, cnt.length);
                    work[i]--;
                    work[i + 1]--;
                    if (work[j] > 1) {
                        work[j] -= 2;
                        if (threes(work)) {
                            if (i > 0 && cnt[i - 1] < 4) ans.add(i - 1);
                            if (i < 7 && cnt[i + 2] < 4) ans.add(i + 2);
                        }
                    }
                }
            }
        }
        for (int i : ans) {
            System.out.println(i + 1);
        }
    }
    static boolean threes(int[] work) {
        boolean flg = true;
        for (int i = 0; i < 9; i++) {
            if (work[i] >= 3) {
                work[i] -= 3;
            }
            while (work[i] > 0) {
                work[i]--;
                if (i < 8 && work[i + 1] > 0) {
                    work[i + 1]--;
                } else {
                    flg = false;
                    break;
                }
                if (i < 7 && work[i + 2] > 0) {
                    work[i + 2]--;
                } else {
                    flg = false;
                    break;
                }
            }
            if (!flg) {
                break;
            }
        }
        return flg;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX