結果
| 問題 |
No.1234 典型RMQ
|
| コンテスト | |
| ユーザー |
 ひばち
|
| 提出日時 | 2020-09-19 01:25:21 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 230 ms / 2,000 ms |
| コード長 | 12,158 bytes |
| コンパイル時間 | 2,720 ms |
| コンパイル使用メモリ | 115,840 KB |
| 実行使用メモリ | 22,912 KB |
| 最終ジャッジ日時 | 2024-11-09 02:04:48 |
| 合計ジャッジ時間 | 9,220 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 27 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using SC = FastScanner;
public partial class Solver
{
public void Solve()
{
var N = sc.Int;
var seg = new LazySegmentTree<long, long>(N, long.MaxValue/10, 0, Min, (a, b) => a + b, (a, b) => a + b);
for (int i = 0; i < N; i++)
{
seg[i] = sc.Long;
}
seg.Build();
var Q = sc.Int;
while (Q-- > 0)
{
int k = sc.Int, l = sc.Int, r = sc.Int, c = sc.Int;l--;
if (k == 1)
{
seg.Update(l, r, c);
}
else Console.WriteLine(seg.Query(l,r));
}
}
}
public class LazySegmentTree<T, E>
{
protected readonly int size, _N, log;
protected readonly T idT;
protected readonly T[] dat;
protected readonly E idE;
protected readonly E[] lazy;
protected readonly Func<T, T, T> mergeT;
protected readonly Func<T, E, T> update;
protected readonly Func<E, E, E> mergeE;
public T this[int i]
{
get { return dat[i + size]; }
set { dat[i + size] = value; }
}
public LazySegmentTree(int N, T idT, E idE, Func<T, T, T> mergeT, Func<T, E, T> update = null, Func<E, E, E> mergeE = null)
{
_N = N;
this.idT = idT;
this.idE = idE;
this.mergeT = mergeT;
this.update = update ?? ((a, b) => a);
this.mergeE = mergeE ?? ((a, b) => b);
while ((1 << log) < N) log++;
size = 1 << log;
dat = new T[2 * size];
lazy = new E[size];
for (var i = 0; i < dat.Length; i++) dat[i] = idT;
for (int i = 0; i < lazy.Length; i++) lazy[i] = idE;
}
public void Build()
{
for (int i = size - 1; i >= 1; i--) Update(i);
}
public void Set(int p, T t)
{
p += size;
for (int i = log; i >= 1; i--) Push(p >> i);
dat[p] = t;
for (int i = 1; i <= log; i++) Update(p >> i);
}
public T Get(int p)
{
p += size;
for (int i = log; i >= 1; i--) Push(p >> i);
return dat[p];
}
public T Query(int l, int r)
{
if (r <= l) return idT;
l += size; r += size;
for (int i = log; i >= 1; i--)
{
if (((l >> i) << i) != l) Push(l >> i);
if (((r >> i) << i) != r) Push(r >> i);
}
var sml = idT; var smr = idT;
while (l < r)
{
if ((l & 1) == 1) sml = mergeT(sml, dat[l++]);
if ((r & 1) == 1) smr = mergeT(dat[--r], smr);
l >>= 1; r >>= 1;
}
return mergeT(sml, smr);
}
public void Update(int l, int r, E e)
{
if (l == r) return;
l += size; r += size;
for (int i = log; i >= 1; i--)
{
if (((l >> i) << i) != l) Push(l >> i);
if (((r >> i) << i) != r) Push((r - 1) >> i);
}
int l2 = l, r2 = r;
while (l < r)
{
if ((l & 1) == 1) Apply(l++, e);
if ((r & 1) == 1) Apply(--r, e);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
for (int i = 1; i <= log; i++)
{
if (((l >> i) << i) != l) Update(l >> i);
if (((r >> i) << i) != r) Update((r - 1) >> i);
}
}
public int MaxRight(int l, Func<T, bool> f)
{
if (l == _N) return _N;
l += size;
for (int i = log; i >= 1; i--) Push(l >> i);
var sm = idT;
do
{
while (l % 2 == 0) l >>= 1;
if (!f(mergeT(sm, dat[l])))
{
while (l < size)
{
Push(l);
l <<= 1;
if (f(mergeT(sm, dat[l])))
{
sm = mergeT(sm, dat[l]);
l++;
}
}
return l - size;
}
sm = mergeT(sm, dat[l]);
l++;
} while ((l & -l) != l);
return _N;
}
public int MinLeft(int r, Func<T, bool> f)
{
if (r == 0) return 0;
r += size;
for (int i = log; i >= 1; i--) Push((r - 1) >> i);
var sm = idT;
do
{
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f(mergeT(dat[r], sm)))
{
while (r < size)
{
Push(r);
r = (r << 1) | 1;
if (f(mergeT(dat[r], sm)))
{
sm = mergeT(dat[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = mergeT(dat[r], sm);
} while ((r & -r) != r);
return 0;
}
void Apply(int k, E e)
{
dat[k] = update(dat[k], e);
if (k < size) lazy[k] = mergeE(lazy[k], e);
}
void Push(int k)
{
Apply(k << 1, lazy[k]);
Apply((k << 1) | 1, lazy[k]);
lazy[k] = idE;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Update(int k) => dat[k] = mergeT(dat[k << 1], dat[(k << 1) | 1]);
}
public class FastScanner
{
//0x0a:LF 0x20:SPC 0x2d:- 0x30 ~ 0x39: 0 ~ 9
static System.IO.Stream str = System.Console.OpenStandardInput();
const int size = 1 << 10;
static byte[] buffer = new byte[size];
static int ptr;
static int len;
public int Int
{
get
{
var c = Read();
while (c < 0x21)
{
c = Read();
}
var n = false;
if (c == '-')
{
n = true;
c = Read();
}
var ret = 0;
while (c >= 0x30)
{
ret = ret * 10 + (c & 15);
c = Read();
}
return n ? -ret : ret;
}
}
public long Long
{
get
{
var c = Read();
while (c < 0x21)
{
c = Read();
}
var n = false;
if (c == '-')
{
n = true;
c = Read();
}
var ret = 0L;
while (c >= 0x30)
{
ret = ret * 10 + (c & 15);
c = Read();
}
return n ? -ret : ret;
}
}
byte Read()
{
if (ptr == len)
{
len = str.Read(buffer, 0, size);
if (len == 0) return 0;
ptr = 0;
}
return buffer[ptr++];
}
}
#region Template
public partial class Solver
{
public SC sc = new SC();
static void Main(string[] args)
{
Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
var sol = new Solver();
int testcase = 1;
//testcase = sol.sc.Int;
//var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
while (testcase-- > 0)
sol.Solve();
Console.Out.Flush();
}
}
public static class Template
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
public static void Out<T>(this IList<T> A, out T a) => a = A[0];
public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
public static string ToStr<T>(this T[][] A) => A.Select(a => a.Concat(" ")).Concat("\n");
public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
public string Str => Console.ReadLine().Trim();
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
public int[] ArrInt1D(int n) => Create(n, () => Int);
public long[] ArrLong1D(int n) => Create(n, () => Long);
public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
private Queue<string> q = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
public void Make<T1>(out T1 v1) => v1 = Next<T1>();
public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
#endregion