結果

問題 No.832 麻雀修行中
ユーザー EmKjp
提出日時 2019-05-24 22:05:01
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 30 ms / 2,000 ms
コード長 4,560 bytes
コンパイル時間 1,525 ms
コンパイル使用メモリ 113,068 KB
実行使用メモリ 26,884 KB
最終ジャッジ日時 2024-09-17 10:42:35
合計ジャッジ時間 2,767 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
partial class Solver
{
    bool CheckA(int[] hist, int count)
    {
        if (count == 2)
        {
            foreach (var h in hist)
            {
                if (h == 2) return true;
            }
            return false;
        }
        else
        {
            for (int index = 1; index <= 9; index++)
            {
                if (hist[index] == 0) continue;
                if (hist[index] >= 3)
                {
                    hist[index] -= 3;
                    if (CheckA(hist, count - 3))
                    {
                        hist[index] += 3;
                        return true;
                    }
                    hist[index] += 3;
                }
                if (index + 2 <= 9 && hist[index] > 0 && hist[index + 1] > 0 && hist[index + 2] > 0)
                {
                    hist[index]--;
                    hist[index + 1]--;
                    hist[index + 2]--;
                    if (CheckA(hist, count - 3))
                    {
                        hist[index]++;
                        hist[index + 1]++;
                        hist[index + 2]++;
                        return true;
                    }
                    hist[index]++;
                    hist[index + 1]++;
                    hist[index + 2]++;
                }
            }
        }
        return false;
    }
    bool CheckB(int[] hist)
    {
        return hist.All(h => h == 0 || h == 2);
    }
    public void Run()
    {
        var S = ns();
        var hist = new int[10];
        foreach (var c in S)
        {
            hist[c - '0']++;
        }
        for (int d = 1; d <= 9; d++)
        {
            if (hist[d] == 4) continue;
            hist[d]++;
            if (CheckA(hist, S.Length + 1) || CheckB(hist))
            {
                cout.WriteLine(d);
            }
            hist[d]--;
        }
    }
}
// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }
    TextReader cin;
    TextWriter cout;
    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }
    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}
public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;
    public Scanner()
        : this(Console.In)
    {
    }
    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }
    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }
    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }
    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }
    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0