結果
| 問題 |
No.469 区間加算と一致検索の問題
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-12-18 01:10:44 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 1,087 ms / 5,000 ms |
| コード長 | 7,157 bytes |
| コンパイル時間 | 2,736 ms |
| コンパイル使用メモリ | 110,976 KB |
| 実行使用メモリ | 89,088 KB |
| 最終ジャッジ日時 | 2024-12-21 16:35:28 |
| 合計ジャッジ時間 | 23,332 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 49 |
コンパイルメッセージ
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 tree1 = new HashSegmentTree(n + 1, rand.Next(10000005, 100000000), 1000000007);
var tree2 = new HashSegmentTree(n + 1, rand.Next(10000005, 100000000), 1000000009);
for (int i = 0; i < n; i++)
tree1.Add(i, 10000000);
var hash = new Dictionary<long, int>();
hash[tree1.Query(0, n) * 1000000009 + tree2.Query(0, n)] = 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();
tree1.Add(l, x);
tree1.Add(r, -x);
tree2.Add(l, x);
tree2.Add(r, -x);
var h = tree1.Query(0, n) * 1000000009 + tree2.Query(0, n);
if (!hash.ContainsKey(h)) hash[h] = i + 1;
}
else if (t == '?')
{
IO.Printer.Out.WriteLine(hash[tree1.Query(0, n) * 1000000009 + tree2.Query(0, n)]);
}
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