#35352 (C#(csc)) No.238 Mr. K's Another Gift

• 問題: No.238 Mr. K's Another Gift
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-07-06 00:05:13
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 202 ms / 2,000 ms
• コード長: 6,816 bytes
• コンパイル時間: 2,999 ms
• コンパイル使用メモリ: 109,692 KB
• 実行使用メモリ: 34,496 KB
• 最終ジャッジ日時: 2023-09-22 08:57:48
• 合計ジャッジ時間: 10,022 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	51 ms; 21,544 KB
testcase_01	AC	51 ms; 21,504 KB
testcase_02	AC	52 ms; 21,292 KB
testcase_03	AC	54 ms; 23,540 KB
testcase_04	AC	59 ms; 19,900 KB
testcase_05	AC	170 ms; 30,380 KB
testcase_06	AC	143 ms; 32,532 KB
testcase_07	AC	183 ms; 32,352 KB
testcase_08	AC	183 ms; 32,432 KB
testcase_09	AC	153 ms; 30,492 KB
testcase_10	AC	51 ms; 21,404 KB
testcase_11	AC	51 ms; 21,412 KB
testcase_12	AC	52 ms; 21,440 KB
testcase_13	AC	56 ms; 21,488 KB
testcase_14	AC	144 ms; 27,692 KB
testcase_15	AC	200 ms; 32,028 KB
testcase_16	AC	202 ms; 32,096 KB
testcase_17	AC	200 ms; 32,020 KB
testcase_18	AC	199 ms; 34,124 KB
testcase_19	AC	200 ms; 32,048 KB
testcase_20	AC	51 ms; 21,276 KB
testcase_21	AC	51 ms; 21,428 KB
testcase_22	AC	51 ms; 21,424 KB
testcase_23	AC	52 ms; 21,524 KB
testcase_24	AC	59 ms; 21,584 KB
testcase_25	AC	63 ms; 22,664 KB
testcase_26	AC	142 ms; 32,640 KB
testcase_27	AC	163 ms; 34,460 KB
testcase_28	AC	82 ms; 34,328 KB
testcase_29	AC	160 ms; 34,496 KB
testcase_30	AC	50 ms; 19,424 KB
testcase_31	AC	51 ms; 21,404 KB
testcase_32	AC	53 ms; 21,484 KB
testcase_33	AC	65 ms; 21,928 KB
testcase_34	AC	184 ms; 31,112 KB
testcase_35	AC	200 ms; 32,000 KB
testcase_36	AC	200 ms; 34,136 KB
testcase_37	AC	199 ms; 29,980 KB
testcase_38	AC	199 ms; 29,948 KB
testcase_39	AC	200 ms; 32,224 KB
testcase_40	AC	51 ms; 21,304 KB
testcase_41	AC	51 ms; 21,504 KB
testcase_42	AC	51 ms; 21,464 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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 go1 = new RollingHash(s);
            var go2 = new RollingHash(s, (ulong)1e9 + 9);
            var rev1 = new RollingHash(s.Reverse().AsString());
            var rev2 = new RollingHash(s.Reverse().AsString(), (ulong)1e9 + 9);
            for (int i = 0, j = n; i <= n; i++, j--)
            {
                for (int k = 0; k < 26; k++)
                    if (go1.BuildHash(i, (ulong)k) == rev1.BuildHash(j, (ulong)k) && go2.BuildHash(i, (ulong)k) == rev2.BuildHash(j, (ulong)k))
                    {
                        IO.Printer.Out.WriteLine(s.Substring(0, i) + (char)('a' + k) + s.Substring(i));
                        return;
                    }
            }
            IO.Printer.Out.WriteLine("NA");

        }
        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; }
    }
}
public class RollingHash
{
    int n;
    ulong[] left, right, shift;
    public ulong mod;
    const ulong OFFSET = 26;
    public ulong ToInteger(char c)
    {
        return (ulong)(c - 'a');
    }
    public RollingHash(string s, ulong m = (ulong)1e9+7)
    {
        n = s.Length;
        mod = m;
        left = new ulong[n + 1];
        right = new ulong[n + 1];
        shift = new ulong[n + 1];
        shift[0] = 1;
        for (int i = 1; i <= n; i++)
            shift[i] = (shift[i - 1] * OFFSET) % mod;
        for (int i = 0; i < n; i++)
            left[i + 1] = (left[i] * OFFSET + ToInteger(s[i])) % mod;
        for (int i = 0, j = n - 1; i < n; i++, j--)
            right[i + 1] = (right[i] + ToInteger(s[j]) * shift[i]) % mod;
    }
    /// <summary>文字列sのハッシュ値を返す</summary>
    public ulong GetHash()
    {
        return left[n];
    }
    /// <summary>文字列sをi番目で分割したときのハッシュ値のペアを返す</summary>
    public KeyValuePair<ulong, ulong> GetHash(int i)
    {
        return new KeyValuePair<ulong, ulong>(left[i], right[n - i]);
    }
    /// <summary>i番目に文字列tを挿入してハッシュを構築</summary>
    public ulong BuildHash(int i, string t)
    {
        var m = t.Length;
        var hash = left[i];
        for (int j = 0; j < m; j++)
            hash = (hash * OFFSET + ToInteger(t[j])) % mod;
        hash = (hash * shift[n - i] + right[n - i]) % mod;
        return hash;
    }
    /// <summary>i番目にハッシュ値hを挿入してハッシュを構築</summary>
    public ulong BuildHash(int i, ulong h)
    {
        var hash = left[i];
        hash = (hash * OFFSET + h) % mod;
        hash = (hash * shift[n - i] + right[n - i]) % mod;
        return hash;
    }
}
#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