結果

問題 No.469 区間加算と一致検索の問題
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-18 02:12:39
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 6,036 bytes
コンパイル時間 1,121 ms
コンパイル使用メモリ 118,276 KB
実行使用メモリ 66,144 KB
最終ジャッジ日時 2024-12-14 07:44:15
合計ジャッジ時間 141,699 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
64,096 KB
testcase_01 AC 29 ms
31,636 KB
testcase_02 AC 52 ms
62,988 KB
testcase_03 AC 32 ms
64,240 KB
testcase_04 AC 36 ms
35,940 KB
testcase_05 AC 36 ms
64,144 KB
testcase_06 AC 35 ms
63,820 KB
testcase_07 AC 38 ms
33,912 KB
testcase_08 AC 36 ms
63,984 KB
testcase_09 AC 33 ms
65,768 KB
testcase_10 AC 31 ms
31,724 KB
testcase_11 AC 33 ms
65,592 KB
testcase_12 AC 36 ms
35,880 KB
testcase_13 AC 34 ms
31,856 KB
testcase_14 AC 30 ms
64,072 KB
testcase_15 AC 32 ms
62,296 KB
testcase_16 AC 34 ms
31,476 KB
testcase_17 AC 36 ms
64,372 KB
testcase_18 AC 38 ms
66,144 KB
testcase_19 AC 32 ms
63,956 KB
testcase_20 AC 38 ms
24,916 KB
testcase_21 AC 32 ms
26,832 KB
testcase_22 AC 30 ms
26,844 KB
testcase_23 AC 3,540 ms
27,364 KB
testcase_24 AC 3,579 ms
27,360 KB
testcase_25 AC 3,550 ms
29,404 KB
testcase_26 AC 3,562 ms
27,496 KB
testcase_27 AC 3,588 ms
27,564 KB
testcase_28 AC 3,565 ms
29,532 KB
testcase_29 AC 3,530 ms
27,492 KB
testcase_30 AC 3,565 ms
25,400 KB
testcase_31 AC 3,589 ms
27,692 KB
testcase_32 AC 3,555 ms
29,544 KB
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 TLE -
testcase_41 TLE -
testcase_42 TLE -
testcase_43 TLE -
testcase_44 TLE -
testcase_45 TLE -
testcase_46 TLE -
testcase_47 TLE -
testcase_48 AC 32 ms
26,996 KB
testcase_49 AC 30 ms
24,804 KB
testcase_50 TLE -
testcase_51 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var q = sc.Integer();
            var rand = new Random();
            var b = new long[2] { rand.Next(10000000, 100000000), rand.Next(10000000, 100000000) };
            var mod = new long[2] { 1000000007, 1000000009 };
            var B = Enumerate(2, x => Enumerate(n + 1, y => 0L));
            for (int i = 0; i < 2; i++)
            {
                B[i][0] = 1;
                for (int j = 1; j <= n; j++)
                    B[i][j] = B[i][j - 1] * b[i] % mod[i];
            }
            var hash = new long[2];
            var dic = new Dictionary<long, int>();
            dic[hash[0] * mod[1] + hash[1]] = 0;
            for (int i = 0; i < q; i++)
            {
                var t = sc.Char();
                if (t == '!')
                {
                    var l = sc.Integer();
                    var r = sc.Integer();
                    var x = sc.Integer();
                    for (int j = l; j < r; j++)
                    {
                        hash[0] = (hash[0] + B[0][j] * x) % mod[0];
                        hash[1] = (hash[1] + B[1][j] * x) % mod[1];
                        if (hash[0] < 0) hash[0] += mod[0];
                        if (hash[1] < 0) hash[1] += mod[1];
                    }
                    var h = hash[0] * mod[1] + hash[1];
                    if (!dic.ContainsKey(h)) dic[h] = i + 1;
                }
                else if (t == '?')
                {
                    IO.Printer.Out.WriteLine(dic[hash[0] * mod[1] + hash[1]]);
                }
                else
                {
                    throw new Exception();
                }

            }

        }
        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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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
0