結果

問題 No.291 黒い文字列
コンテスト
ユーザー 紙ぺーぱー
提出日時 2015-10-17 01:16:04
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 6,036 bytes
コンパイル時間 1,126 ms
コンパイル使用メモリ 120,784 KB
実行使用メモリ 104,656 KB
最終ジャッジ日時 2024-07-22 07:03:20
合計ジャッジ時間 4,450 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 15 RE * 11
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var s = sc.Scan();
            var n = s.Length;
            var dp = new int[n + 1, 194500];
            for (int i = 0; i <= n; i++)
                for (int j = 0; j < 194500; j++)
                    dp[i, j] = -1;
            Func<int, automaton, int> dfs = null;
            dfs = (pos, otaku) =>
            {
                if (pos == n) return 0;
                if (dp[pos, otaku.Hash / automaton.WIDTH] != -1)
                    return dp[pos, otaku.Hash / automaton.WIDTH];
                var res = dfs(pos + 1, otaku);
                for (int i = 1; i <= 5; i++)
                {
                    if (s[pos] == automaton.pattern[i] || s[pos] == '?')
                    {
                        if (otaku.Shift(i))
                        {
                            res = Math.Max(res, dfs(pos + 1, otaku) + (i == 5 ? 1 : 0));
                            otaku.Back(i);
                        }
                    }
                }
                return dp[pos, otaku.Hash / automaton.WIDTH] = res;
            };
            var ans = dfs(0, new automaton());
            IO.Printer.Out.WriteLine(ans);
        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
public class automaton
{
    public const string pattern = "$KUROI";
    public const int WIDTH = 21;
    public int[] a = new int[pattern.Length];
    public automaton()
    {
        a[0] = 1145141919;
    }
    public bool Shift(int i)
    {
        if (a[i - 1] == 0 || a[i] == WIDTH) return false;
        a[i - 1]--;
        a[i]++;
        return true;
    }
    public bool Back(int i)
    {
        a[i - 1]++;
        a[i]--;
        return true;
    }
    public int Hash
    {
        get
        {
            var ret = 0;
            for (int i = 1; i < a.Length; i++)
                ret = ret * WIDTH + a[i];
            return ret;
        }
    }
}
0