結果

問題 No.291 黒い文字列
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-10-16 23:27:13
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 772 ms / 2,000 ms
コード長 6,914 bytes
コンパイル時間 1,136 ms
コンパイル使用メモリ 120,808 KB
実行使用メモリ 94,848 KB
最終ジャッジ日時 2024-07-21 20:38:34
合計ジャッジ時間 5,848 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
23,168 KB
testcase_01 AC 32 ms
22,400 KB
testcase_02 AC 34 ms
26,368 KB
testcase_03 AC 35 ms
26,240 KB
testcase_04 AC 32 ms
22,528 KB
testcase_05 AC 31 ms
22,528 KB
testcase_06 AC 29 ms
20,992 KB
testcase_07 AC 32 ms
23,296 KB
testcase_08 AC 32 ms
23,808 KB
testcase_09 AC 30 ms
21,632 KB
testcase_10 AC 50 ms
45,440 KB
testcase_11 AC 44 ms
36,864 KB
testcase_12 AC 43 ms
36,864 KB
testcase_13 AC 33 ms
22,400 KB
testcase_14 AC 37 ms
30,080 KB
testcase_15 AC 35 ms
26,240 KB
testcase_16 AC 102 ms
61,184 KB
testcase_17 AC 139 ms
68,736 KB
testcase_18 AC 109 ms
64,896 KB
testcase_19 AC 310 ms
80,384 KB
testcase_20 AC 374 ms
80,768 KB
testcase_21 AC 100 ms
94,720 KB
testcase_22 AC 531 ms
94,720 KB
testcase_23 AC 772 ms
94,848 KB
testcase_24 AC 308 ms
94,848 KB
testcase_25 AC 125 ms
94,336 KB
testcase_26 AC 108 ms
94,592 KB
testcase_27 AC 89 ms
94,464 KB
testcase_28 AC 92 ms
94,848 KB
testcase_29 AC 105 ms
94,592 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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();
            //s = Enumerable.Repeat('?', 100).AsString();
            var n = s.Length;
            var ns = new List<char>();
            foreach (var x in s)
                if ("KUROI?".Contains(x)) ns.Add(x);
            s = ns.AsString();
            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;
            var width = new int[4];
            width[0] = 1;
            for (int i = 1; i < 4; i++)
                width[i] = width[i - 1] * 21;
            Func<int, int, int> dfs = null;
            dfs = (pos, otaku) =>
              {
                  if (pos == n) return 0;
                  var o = otaku / width[3];
                  var t = (otaku / width[2]) % 21;
                  var a = (otaku / width[1]) % 21;
                  var k = otaku % 21;
                  if (dp[pos, otaku] != -1)
                      return dp[pos, otaku];
                  var res = dfs(pos + 1, otaku);
                  if ((s[pos] == 'K' || s[pos] == '?') && o < 20)
                      res = Math.Max(res, dfs(pos + 1, (o + 1) * width[3] + t * width[2] + a * width[1] + k));
                  if ((s[pos] == 'U' || s[pos] == '?') && o > 0 && t < 20)
                      res = Math.Max(res, dfs(pos + 1, (o - 1) * width[3] + (t + 1) * width[2] + a * width[1] + k));
                  if ((s[pos] == 'R' || s[pos] == '?') && t > 0 && a < 20)
                      res = Math.Max(res, dfs(pos + 1, o * width[3] + (t - 1) * width[2] + (a + 1) * width[1] + k));
                  if ((s[pos] == 'O' || s[pos] == '?') && a > 0 && k < 20)
                      res = Math.Max(res, dfs(pos + 1, o * width[3] + t * width[2] + (a - 1) * width[1] + k + 1));
                  if ((s[pos] == 'I' || s[pos] == '?') && k > 0)
                      res = Math.Max(res, dfs(pos + 1, o * width[3] + t * width[2] + a * width[1] + k - 1) + 1);

                  return dp[pos, otaku] = res;
              };
            var ans = dfs(0, 0);
            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
#region HashMap
public class HashMap<K, V> : Dictionary<K, V>
//where V : new()
{
    public HashMap() : base() { }
    public HashMap(int cap) : base(cap) { }
    new public V this[K i]
    {
        get
        {
            V v;
            return TryGetValue(i, out v) ? v :
                base[i] = default(V);
            //base[i] = new V();
        }
        set { base[i] = value; }
    }
}
#endregion

struct otaku
{
    public int k, u, r, o;
    public otaku(int[] a)
    {
        k = a[0]; u = a[1]; r = a[2]; o = a[3];
    }
}
0