結果
問題 | No.469 区間加算と一致検索の問題 |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-12-18 01:46:07 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,988 bytes |
コンパイル時間 | 1,379 ms |
コンパイル使用メモリ | 117,936 KB |
実行使用メモリ | 64,040 KB |
最終ジャッジ日時 | 2024-05-08 06:10:54 |
合計ジャッジ時間 | 6,467 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
24,672 KB |
testcase_01 | AC | 30 ms
26,872 KB |
testcase_02 | AC | 36 ms
29,136 KB |
testcase_03 | AC | 27 ms
26,828 KB |
testcase_04 | AC | 28 ms
26,836 KB |
testcase_05 | AC | 29 ms
25,044 KB |
testcase_06 | AC | 27 ms
24,404 KB |
testcase_07 | AC | 29 ms
24,656 KB |
testcase_08 | AC | 29 ms
26,832 KB |
testcase_09 | AC | 27 ms
24,656 KB |
testcase_10 | AC | 27 ms
26,712 KB |
testcase_11 | AC | 27 ms
24,784 KB |
testcase_12 | AC | 29 ms
26,768 KB |
testcase_13 | AC | 27 ms
24,532 KB |
testcase_14 | AC | 27 ms
24,652 KB |
testcase_15 | AC | 28 ms
25,052 KB |
testcase_16 | AC | 30 ms
26,704 KB |
testcase_17 | AC | 30 ms
26,708 KB |
testcase_18 | AC | 28 ms
24,908 KB |
testcase_19 | AC | 28 ms
24,672 KB |
testcase_20 | AC | 30 ms
26,576 KB |
testcase_21 | AC | 28 ms
24,524 KB |
testcase_22 | AC | 26 ms
22,576 KB |
testcase_23 | WA | - |
testcase_24 | AC | 43 ms
27,660 KB |
testcase_25 | WA | - |
testcase_26 | AC | 50 ms
27,788 KB |
testcase_27 | AC | 44 ms
27,364 KB |
testcase_28 | AC | 44 ms
27,492 KB |
testcase_29 | AC | 43 ms
27,660 KB |
testcase_30 | AC | 44 ms
27,752 KB |
testcase_31 | WA | - |
testcase_32 | AC | 43 ms
29,576 KB |
testcase_33 | AC | 151 ms
61,988 KB |
testcase_34 | AC | 156 ms
56,320 KB |
testcase_35 | AC | 157 ms
61,868 KB |
testcase_36 | AC | 155 ms
56,064 KB |
testcase_37 | AC | 153 ms
64,040 KB |
testcase_38 | AC | 155 ms
53,376 KB |
testcase_39 | AC | 151 ms
56,972 KB |
testcase_40 | AC | 182 ms
53,120 KB |
testcase_41 | AC | 150 ms
61,060 KB |
testcase_42 | AC | 183 ms
53,376 KB |
testcase_43 | AC | 176 ms
59,300 KB |
testcase_44 | AC | 193 ms
53,376 KB |
testcase_45 | WA | - |
testcase_46 | AC | 148 ms
53,376 KB |
testcase_47 | AC | 152 ms
61,012 KB |
testcase_48 | AC | 26 ms
18,944 KB |
testcase_49 | AC | 25 ms
18,560 KB |
testcase_50 | AC | 154 ms
53,376 KB |
testcase_51 | AC | 149 ms
58,984 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.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 cumB = Enumerate(2, x => Enumerate(n + 1, y => 0L)); for (int i = 0; i < 2; i++) { var B = new long[n + 1]; B[0] = 1; for (int j = 1; j <= n; j++) B[j] = B[j - 1] * b[i] % mod[i]; for (int j = 0; j < n; j++) cumB[i][j + 1] = (B[j] + cumB[i][j]) % mod[i]; } var hash = new long[2]; hash[0] = cumB[0][n - 1]; hash[1] = cumB[1][n - 1]; var dic = new Dictionary<long, 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]; hash[p] = (hash[p] + y * x) % mod[p]; if (hash[p] < 0) hash[p] += mod[p]; } var h = hash[0]; if (!dic.ContainsKey(h)) dic[h] = i + 1; } else if (t == '?') IO.Printer.Out.WriteLine(dic[hash[0]]); } } 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