結果

問題 No.469 区間加算と一致検索の問題
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-18 01:44:38
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,583 bytes
コンパイル時間 988 ms
コンパイル使用メモリ 117,620 KB
実行使用メモリ 67,624 KB
最終ジャッジ日時 2024-05-08 06:10:42
合計ジャッジ時間 5,426 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
22,704 KB
testcase_01 AC 27 ms
24,416 KB
testcase_02 AC 32 ms
27,364 KB
testcase_03 AC 29 ms
24,656 KB
testcase_04 WA -
testcase_05 AC 27 ms
25,036 KB
testcase_06 AC 28 ms
24,784 KB
testcase_07 AC 28 ms
26,704 KB
testcase_08 AC 29 ms
22,604 KB
testcase_09 WA -
testcase_10 AC 29 ms
26,952 KB
testcase_11 WA -
testcase_12 AC 29 ms
27,016 KB
testcase_13 AC 28 ms
24,912 KB
testcase_14 AC 26 ms
26,700 KB
testcase_15 AC 26 ms
24,968 KB
testcase_16 AC 29 ms
24,916 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 26 ms
26,832 KB
testcase_20 AC 27 ms
24,912 KB
testcase_21 WA -
testcase_22 AC 28 ms
24,884 KB
testcase_23 AC 41 ms
27,744 KB
testcase_24 AC 41 ms
29,912 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 41 ms
27,664 KB
testcase_28 AC 42 ms
27,788 KB
testcase_29 WA -
testcase_30 AC 44 ms
27,784 KB
testcase_31 WA -
testcase_32 AC 42 ms
27,616 KB
testcase_33 WA -
testcase_34 AC 107 ms
66,580 KB
testcase_35 AC 108 ms
67,624 KB
testcase_36 AC 102 ms
62,340 KB
testcase_37 AC 101 ms
62,216 KB
testcase_38 WA -
testcase_39 AC 96 ms
59,132 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 AC 96 ms
63,316 KB
testcase_43 AC 96 ms
61,200 KB
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 AC 26 ms
22,448 KB
testcase_49 AC 25 ms
24,800 KB
testcase_50 AC 95 ms
65,244 KB
testcase_51 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 ulong[2] { (ulong)rand.Next(10000000, 100000000), (ulong)rand.Next(10000000, 100000000) };
            var cumB = Enumerate(2, x => Enumerate(n + 1, y => 0UL));
            for (int i = 0; i < 2; i++)
            {
                var B = new ulong[n + 1];
                B[0] = 1;
                for (int j = 1; j <= n; j++)
                    B[j] = B[j - 1] * b[i];
                for (int j = 0; j < n; j++)
                    cumB[i][j + 1] = (B[j] + cumB[i][j]);
            }
            var hash = new ulong[2];
            hash[0] = cumB[0][n - 1];
            hash[1] = cumB[1][n - 1];
            var dic = new Dictionary<ulong, int>();
            dic[hash[0]] = 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 p = 0; p < 2; p++)
                    {
                        var y = cumB[p][r] - cumB[p][l];
                        ulong xx = (ulong)Math.Abs(x);
                        if (x >= 0)
                            hash[p] = (hash[p] + y * xx);
                        else hash[p] = (hash[p] - y * xx);
                    }
                    var h = hash[0];
                    if (!dic.ContainsKey(h)) dic[h] = i + 1;
                }
                else if (t == '?')
                {
                    IO.Printer.Out.WriteLine(dic[hash[0]]);
                }
                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
#region Hash Segment Tree
public class HashSegmentTree
{
    long b;
    long mod;
    int n;
    Number[] data;
    long[] B;
    public HashSegmentTree(int size, long _b, long _mod)
    {

        b = _b;
        mod = _mod;
        n = 1;
        while (n < size)
            n <<= 1;
        data = new Number[n << 1];
        B = new long[n << 1];
        B[0] = 1;
        for (int i = 1; i < n << 1; i++)
            B[i] = B[i - 1] * b % mod;
    }
    public void Add(int k, Number v)
    {
        k += n;
        data[k] += v;
        k >>= 1;
        long bb = b;
        while (k > 0)
        {
            data[k] = (data[k * 2] + data[k * 2 + 1] * bb) % mod;
            k >>= 1;
            bb = (bb * bb) % mod;
        }

    }
    public Number Query(int a, int b) { return query(a, b, 1, 0, n); }
    private Number query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return 0;
        if (a <= l && r <= b)
            return data[k];
        else
        {
            var vl = query(a, b, k << 1, l, (l + r) >> 1);
            var vr = query(a, b, (k << 1) + 1, (l + r) >> 1, r);
            return (vl + vr * B[(l + r) / 2 - l]) % mod;
        }
    }
    public Number[] Items
    {
        get
        {
            var ret = new Number[n];
            for (int i = 0; i < n; i++)
                ret[i] = data[i + n];
            return ret;
        }
    }

}
#endregion
0