結果

問題 No.469 区間加算と一致検索の問題
ユーザー eitahoeitaho
提出日時 2016-12-19 22:28:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 844 ms / 5,000 ms
コード長 5,093 bytes
コンパイル時間 3,764 ms
コンパイル使用メモリ 110,580 KB
実行使用メモリ 123,336 KB
最終ジャッジ日時 2023-08-23 13:29:02
合計ジャッジ時間 24,075 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
22,768 KB
testcase_01 AC 64 ms
22,820 KB
testcase_02 AC 73 ms
24,436 KB
testcase_03 AC 76 ms
24,876 KB
testcase_04 AC 77 ms
24,808 KB
testcase_05 AC 77 ms
20,972 KB
testcase_06 AC 80 ms
24,848 KB
testcase_07 AC 80 ms
24,836 KB
testcase_08 AC 81 ms
24,800 KB
testcase_09 AC 73 ms
20,720 KB
testcase_10 AC 82 ms
22,688 KB
testcase_11 AC 72 ms
22,860 KB
testcase_12 AC 83 ms
27,400 KB
testcase_13 AC 76 ms
20,796 KB
testcase_14 AC 69 ms
22,760 KB
testcase_15 AC 71 ms
22,820 KB
testcase_16 AC 80 ms
22,864 KB
testcase_17 AC 79 ms
22,744 KB
testcase_18 AC 82 ms
22,944 KB
testcase_19 AC 70 ms
24,900 KB
testcase_20 AC 82 ms
26,956 KB
testcase_21 AC 71 ms
22,724 KB
testcase_22 AC 67 ms
22,964 KB
testcase_23 AC 218 ms
40,252 KB
testcase_24 AC 220 ms
40,248 KB
testcase_25 AC 219 ms
40,256 KB
testcase_26 AC 220 ms
40,208 KB
testcase_27 AC 220 ms
40,376 KB
testcase_28 AC 222 ms
38,204 KB
testcase_29 AC 221 ms
40,512 KB
testcase_30 AC 220 ms
36,100 KB
testcase_31 AC 219 ms
38,320 KB
testcase_32 AC 221 ms
38,256 KB
testcase_33 AC 822 ms
121,636 KB
testcase_34 AC 839 ms
120,740 KB
testcase_35 AC 842 ms
121,172 KB
testcase_36 AC 842 ms
122,500 KB
testcase_37 AC 833 ms
123,336 KB
testcase_38 AC 829 ms
119,120 KB
testcase_39 AC 828 ms
119,256 KB
testcase_40 AC 840 ms
119,200 KB
testcase_41 AC 837 ms
117,268 KB
testcase_42 AC 831 ms
119,208 KB
testcase_43 AC 844 ms
117,144 KB
testcase_44 AC 813 ms
117,628 KB
testcase_45 AC 823 ms
119,268 KB
testcase_46 AC 824 ms
119,212 KB
testcase_47 AC 821 ms
117,060 KB
testcase_48 AC 66 ms
24,764 KB
testcase_49 AC 64 ms
22,764 KB
testcase_50 AC 823 ms
119,220 KB
testcase_51 AC 832 ms
117,476 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.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    Dictionary<long, int> dic = new Dictionary<long, int>();
    static readonly long Mod0 = (long)1e9 + 7, Mod1 = (long)1e9 + 9;
    int N;
    RangeCoefAddSumSegTree seg1, seg2;

    public void Solve()
    {
        N = Reader.Int();
        int NQ = Reader.Int();
        var Q = Reader.StringTable(NQ);
        Init();
        dic[0] = 0;
        var ans = new List<int>();
        for (int qi = 0; qi < NQ; qi++)
            if (Q[qi][0] == "!") Add(int.Parse(Q[qi][1]), int.Parse(Q[qi][2]), int.Parse(Q[qi][3]), qi + 1);
            else ans.Add(dic[Key()]);
        Console.WriteLine(string.Join("\n", ans));
    }

    void Init()
    {
        var random = new Random();
        var C = new int[N];

        long mult = random.Next((int)1e7 + 1, (int)Mod0);
        for (long i = 0, m = 1; i < N; i++, m = m * mult % Mod0) C[i] = (int)m;
        seg1 = new RangeCoefAddSumSegTree(N, C, (int)Mod0);

        mult = random.Next((int)1e7 + 1, (int)Mod1);
        for (long i = 0, m = 1; i < N; i++, m = m * mult % Mod1) C[i] = (int)m;
        seg2 = new RangeCoefAddSumSegTree(N, C, (int)Mod1);
    }

    long Key() { return seg1.Sum() << 32 | seg2.Sum(); }

    void Add(int L, int R, int val, int time)
    {
        seg1.Add(L, R, val);
        seg2.Add(L, R, val);
        long key = Key();
        if (!dic.ContainsKey(key)) dic[key] = time;
    }
}

class RangeCoefAddSumSegTree
{
    public readonly int N, Mod;
    private readonly long[] V, S, Mult;
    static readonly long[] Q = new long[100];

    public RangeCoefAddSumSegTree(int n, int[] mult, int mod)
    {
        for (N = 2; N < n; ) N *= 2;
        Mod = mod;
        V = new long[N * 2];
        S = new long[N * 2];
        Mult = new long[N + 1];
        for (int i = 0; i < mult.Length; i++)
            Mult[i + 1] = (Mult[i] + mult[i]) % Mod;
    }

    public long Sum(int L = 0, int R = int.MaxValue) { return Sum(0, 0, N, L, R); }
    private long Sum(int i, int currL, int currR, int L, int R)
    {
        if (currL >= R || currR <= L) return 0;
        if (currL >= L && currR <= R)
            return ((S[i] + V[i] * (Mod + Mult[currR] - Mult[currL])) % Mod + Mod) % Mod;
        long res = V[i] * (Mod + Mult[Math.Min(currR, R)] - Mult[Math.Max(currL, L)]) % Mod;
        int mid = (currL + currR) >> 1;
        res = (res + Sum(i * 2 + 1, currL, mid, L, R)) % Mod;
        res = (res + Sum(i * 2 + 2, mid, currR, L, R)) % Mod;
        return res;
    }

    public void Add(int L, int R, long val)
    {
        Q[0] = 0;
        for (int s = 0, t = 1, len = N, first = 1; s != t; ++s)
        {
            int i = (int)(Q[s] >> 32), a = (int)Q[s];
            if (s == first) { len >>= 1; first = t; }
            if (a >= L && a + len <= R) { V[i] = (V[i] + val) % Mod; continue; }
            S[i] = (S[i] + val * (Mod + Mult[Math.Min(a + len, R)] - Mult[Math.Max(a, L)])) % Mod;
            int mid = a + (len >> 1);
            if (L < mid) Q[t++] = ((long)(i << 1) + 1 << 32) + a;
            if (R > mid) Q[t++] = ((long)(i << 1) + 2 << 32) + mid;
        }
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0