結果
| 問題 |
No.832 麻雀修行中
|
| コンテスト | |
| ユーザー |
 kusomushi
|
| 提出日時 | 2019-06-13 21:35:05 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 69 ms / 2,000 ms |
| コード長 | 5,883 bytes |
| コンパイル時間 | 2,612 ms |
| コンパイル使用メモリ | 85,916 KB |
| 実行使用メモリ | 38,104 KB |
| 最終ジャッジ日時 | 2024-10-15 15:48:49 |
| 合計ジャッジ時間 | 5,169 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 6 |
| other | AC * 25 |
ソースコード
import java.io.*;
import java.util.*;
import java.util.stream.IntStream;
public class Main {
static String S;
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
S = sc.next();
writeLines(solve());
}
static int[] solve() {
List<Integer> list = new ArrayList<>();
for (int i = 1; i <= 9; i++) {
if( check(i) ) {
list.add(i);
}
}
return list.stream().mapToInt(i -> i).toArray();
}
static boolean check(int add) {
int[] cnt = new int[10];
for (int i = 0; i < S.length(); i++) {
char c = S.charAt(i);
cnt[c - '0']++;
}
if( cnt[add] == 4 ) return false;
cnt[add]++;
if( is7tt(cnt) ) return true;
return dfs(1, cnt, false);
}
static boolean is7tt(int[] cnt) {
return IntStream.of(cnt).filter(i -> i == 2).count() == 7;
}
static boolean dfs(int i, int[] cnt, boolean h) {
// debug(cnt, h);
if( i == 10 ) {
return h;
}
if( cnt[i] == 0 ) {
return dfs(i+1, cnt, h);
}
if( !h && cnt[i] >= 2 ) {
cnt[i]-=2;
boolean ok = dfs(i, cnt, true);
if( ok ) return true;
cnt[i]+=2;
}
if( cnt[i] >= 3 ) {
cnt[i]-=3;
boolean ok = dfs(i, cnt, h);
if( ok ) return true;
cnt[i]+=3;
}
if( i <= 7 ) {
if( cnt[i] > 0 && cnt[i+1] > 0 && cnt[i+2] > 0 ) {
cnt[i]--;
cnt[i+1]--;
cnt[i+2]--;
boolean ok = dfs(i, cnt, h);
if( ok ) return true;
cnt[i]++;
cnt[i+1]++;
cnt[i+2]++;
}
}
return false;
}
@SuppressWarnings("unused")
static class FastScanner {
private BufferedReader reader;
private StringTokenizer tokenizer;
FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
long nextLong() {
return Long.parseLong(next());
}
int nextInt() {
return Integer.parseInt(next());
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
int[] nextIntArray(int n, int delta) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt() + delta;
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
}
static void writeLines(int[] as) {
PrintWriter pw = new PrintWriter(System.out);
for (int a : as) pw.println(a);
pw.flush();
}
static void writeLines(long[] as) {
PrintWriter pw = new PrintWriter(System.out);
for (long a : as) pw.println(a);
pw.flush();
}
static void writeSingleLine(int[] as) {
PrintWriter pw = new PrintWriter(System.out);
for (int i = 0; i < as.length; i++) {
if (i != 0) pw.print(" ");
pw.print(as[i]);
}
pw.println();
pw.flush();
}
static int max(int... as) {
int max = Integer.MIN_VALUE;
for (int a : as) max = Math.max(a, max);
return max;
}
static int min(int... as) {
int min = Integer.MAX_VALUE;
for (int a : as) min = Math.min(a, min);
return min;
}
static void debug(Object... args) {
StringJoiner j = new StringJoiner(" ");
for (Object arg : args) {
if (arg == null) j.add("null");
else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
else j.add(arg.toString());
}
System.err.println(j.toString());
}
static void printSingleLine(int[] array) {
PrintWriter pw = new PrintWriter(System.out);
for (int i = 0; i < array.length; i++) {
if (i != 0) pw.print(" ");
pw.print(array[i]);
}
pw.println();
pw.flush();
}
static int lowerBound(int[] array, int value) {
int lo = 0, hi = array.length, mid;
while (lo < hi) {
mid = (hi + lo) / 2;
if (array[mid] < value) lo = mid + 1;
else hi = mid;
}
return lo;
}
static int upperBound(int[] array, int value) {
int lo = 0, hi = array.length, mid;
while (lo < hi) {
mid = (hi + lo) / 2;
if (array[mid] <= value) lo = mid + 1;
else hi = mid;
}
return lo;
}
}