結果
問題 | No.469 区間加算と一致検索の問題 |
ユーザー | eitaho |
提出日時 | 2016-12-19 22:46:22 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 332 ms / 5,000 ms |
コード長 | 3,429 bytes |
コンパイル時間 | 2,681 ms |
コンパイル使用メモリ | 105,796 KB |
実行使用メモリ | 72,604 KB |
最終ジャッジ日時 | 2023-08-23 13:30:14 |
合計ジャッジ時間 | 14,229 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
24,828 KB |
testcase_01 | AC | 67 ms
22,828 KB |
testcase_02 | AC | 74 ms
23,796 KB |
testcase_03 | AC | 73 ms
20,836 KB |
testcase_04 | AC | 76 ms
22,836 KB |
testcase_05 | AC | 77 ms
24,884 KB |
testcase_06 | AC | 77 ms
22,796 KB |
testcase_07 | AC | 78 ms
22,856 KB |
testcase_08 | AC | 78 ms
22,844 KB |
testcase_09 | AC | 74 ms
24,784 KB |
testcase_10 | AC | 85 ms
24,828 KB |
testcase_11 | AC | 72 ms
24,920 KB |
testcase_12 | AC | 79 ms
25,232 KB |
testcase_13 | AC | 75 ms
22,792 KB |
testcase_14 | AC | 71 ms
22,784 KB |
testcase_15 | AC | 73 ms
24,988 KB |
testcase_16 | AC | 80 ms
22,852 KB |
testcase_17 | AC | 77 ms
24,796 KB |
testcase_18 | AC | 77 ms
22,796 KB |
testcase_19 | AC | 71 ms
22,776 KB |
testcase_20 | AC | 79 ms
24,940 KB |
testcase_21 | AC | 72 ms
24,968 KB |
testcase_22 | AC | 69 ms
20,820 KB |
testcase_23 | AC | 143 ms
39,116 KB |
testcase_24 | AC | 143 ms
37,276 KB |
testcase_25 | AC | 146 ms
39,256 KB |
testcase_26 | AC | 143 ms
41,084 KB |
testcase_27 | AC | 142 ms
37,104 KB |
testcase_28 | AC | 146 ms
39,068 KB |
testcase_29 | AC | 142 ms
37,108 KB |
testcase_30 | AC | 144 ms
39,160 KB |
testcase_31 | AC | 146 ms
39,384 KB |
testcase_32 | AC | 144 ms
37,244 KB |
testcase_33 | AC | 328 ms
69,428 KB |
testcase_34 | AC | 331 ms
71,536 KB |
testcase_35 | AC | 331 ms
72,464 KB |
testcase_36 | AC | 330 ms
69,544 KB |
testcase_37 | AC | 332 ms
72,604 KB |
testcase_38 | AC | 326 ms
68,160 KB |
testcase_39 | AC | 325 ms
66,436 KB |
testcase_40 | AC | 326 ms
64,280 KB |
testcase_41 | AC | 324 ms
68,256 KB |
testcase_42 | AC | 323 ms
68,684 KB |
testcase_43 | AC | 317 ms
68,492 KB |
testcase_44 | AC | 319 ms
64,360 KB |
testcase_45 | AC | 316 ms
68,560 KB |
testcase_46 | AC | 318 ms
68,400 KB |
testcase_47 | AC | 319 ms
68,364 KB |
testcase_48 | AC | 67 ms
22,832 KB |
testcase_49 | AC | 64 ms
22,876 KB |
testcase_50 | AC | 322 ms
66,524 KB |
testcase_51 | AC | 319 ms
68,272 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.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 Mod1 = (long)1e9 + 7, Mod2 = (long)1e9 + 9; int N; long sum1, sum2; long[] C1, C2; 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(); long mult = random.Next((int)1e7 + 1, (int)Mod1); C1 = new long[N + 1]; for (long i = 0, m = 1; i < N; i++, m = m * mult % Mod1) C1[i + 1] = (C1[i] + m) % Mod1; mult = random.Next((int)1e7 + 1, (int)Mod1); C2 = new long[N + 1]; for (long i = 0, m = 1; i < N; i++, m = m * mult % Mod2) C2[i + 1] = (C2[i] + m) % Mod2; } long Key() { return sum1 << 32 | sum2; } void Add(int L, int R, int val, int time) { sum1 = ((sum1 + (C1[R] - C1[L]) * val) % Mod1 + Mod1) % Mod1; sum2 = ((sum2 + (C2[R] - C2[L]) * val) % Mod2 + Mod2) % Mod2; long key = Key(); if (!dic.ContainsKey(key)) dic[key] = time; } } 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; } }