結果

問題 No.776 A Simple RMQ Problem
ユーザー ひばち
提出日時 2019-11-09 15:34:38
言語 C#
(csc 3.100.19.26603)
結果
AC  
実行時間 2,617 ms
コード長 9,649 Byte
コンパイル時間 2,643 ms
使用メモリ 66,648 KB
最終ジャッジ日時 2019-11-09 15:35:25

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample_01.txt AC 44 ms
16,760 KB
0_sample_02.txt AC 52 ms
18,804 KB
1_random_01.txt AC 250 ms
34,812 KB
1_random_02.txt AC 835 ms
49,288 KB
1_random_03.txt AC 1,124 ms
44,180 KB
1_random_04.txt AC 1,823 ms
62,912 KB
1_random_05.txt AC 523 ms
34,856 KB
1_random_06.txt AC 1,150 ms
49,284 KB
1_random_07.txt AC 1,428 ms
44,496 KB
1_random_08.txt AC 436 ms
45,156 KB
1_random_09.txt AC 803 ms
41,860 KB
1_random_10.txt AC 1,487 ms
56,480 KB
2_max_01.txt AC 1,968 ms
60,496 KB
2_max_02.txt AC 2,009 ms
65,036 KB
2_max_03.txt AC 1,932 ms
66,648 KB
2_max_04.txt AC 1,977 ms
58,488 KB
2_max_05.txt AC 1,936 ms
64,560 KB
3_special_01.txt AC 2,617 ms
52,808 KB
3_special_02.txt AC 1,394 ms
61,108 KB
3_special_03.txt AC 2,241 ms
56,244 KB
3_special_04.txt AC 2,282 ms
56,856 KB
3_special_05.txt AC 2,252 ms
52,264 KB
3_special_06.txt AC 2,251 ms
50,384 KB
3_special_07.txt AC 2,245 ms
54,160 KB
3_special_08.txt AC 2,312 ms
49,736 KB
3_special_09.txt AC 271 ms
20,900 KB
3_special_10.txt AC 1,325 ms
63,836 KB
3_special_11.txt AC 1,153 ms
64,016 KB
テストケース一括ダウンロード
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.100.19.26603 (9d80dea7)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Convert;
using static System.Math;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{
    public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
    public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
    public static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = t; }
    public static void Fail() { WriteLine("No"); Console.Out.Close(); Environment.Exit(0); }
    static void Main(string[] args)
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        var p = new Program();
        for (var i = 1; i > 0; --i)
            p.Solve();
        Console.Out.Flush();
    }
    SegmentTree<long[]> seg;
    void Solve()
    {
        int num, q;
        Input.Make(out num, out q);
        seg = new SegmentTree<long[]>(num, new[] { 0, long.MinValue / 3, long.MinValue / 3, long.MinValue / 3 }, (a, b) => new[] { a[0] + b[0], Max(a[1], a[0] + b[1]), Max(b[2], a[2] + b[0]), new[] {a[3],b[3],a[2]+b[1] }.Max() });
        for (var i = 0; i < num; i++)
            seg[i] = Enumerable.Repeat(Input.Next<long>(), 4).ToArray();
        seg.All_Update();
        while (q-- > 0)
        {
            var s = Input.Next<string>();
            if (s == "set")
            {
                int i;long x;
                Input.Make(out i, out x);
                seg.Update(i - 1, new[] { x, x, x, x });
                continue;
            }
            int l1, l2, r1, r2;
            Input.Make(out l1, out l2, out r1, out r2);
            l1--;r1--;
            chmax(ref r1, l1);chmin(ref l2, r2);
            if (l2 < r1)
            {
                WriteLine(calc(l1, l2, r1, r2));
                continue;
            }
            var m = Max(calc(l1, l2, l2, r2), calc(l1, r1, r1, r2));
            var a = seg.Query(r1, l2);
            WriteLine(Max(m, a[3]));
        }
    }
    long calc(int l1, int l2, int r1, int r2)
    {
        var a = seg.Query(l1, l2);
        var b = l2 != r1 ? seg.Query(l2, r1)[0] : 0;
        var c = seg.Query(r1, r2);
        return a[2] + b + c[1];
    }
}


public class SegmentTree<T>
{
    protected readonly T[] item;
    protected readonly int num;
    protected readonly Func<T, T, T> func;
    protected readonly Func<T, T, T> updateFunc;
    protected readonly T init;

    protected int Parent(int index)
        => (index - 1) >> 1;
    protected int Left(int index)
        => (index << 1) + 1;
    protected int Right(int index)
        => (index + 1) << 1;
    public T this[int i]
    {
        get { return item[i + num - 1]; }
        set { item[i + num - 1] = value; }
    }

    public SegmentTree(int num, T init, Func<T, T, T> func, Func<T, T, T> updateFunc = null)
    {
        this.func = func;
        this.num = 1;
        this.init = init;
        this.updateFunc = updateFunc ?? ((T val1, T val2) => val2);
        while (this.num <= num)
            this.num *= 2;
        item = new T[2 * this.num - 1];
        for (var i = 0; i < 2 * this.num - 1; i++)
            item[i] = init;
    }
    public void Update(int index, T value)
    {
        index += num - 1;
        item[index] = updateFunc(item[index], value);
        while (index > 0)
        {
            index = Parent(index);
            item[index] = func(item[Left(index)], item[Right(index)]);
        }
    }
    public virtual void Update(int left, int right, T value)
        => Update(left, right, 0, 0, num, value);
    protected virtual void Update(int left, int right, int k, int l, int r, T value)
    {
        if (r <= left || right <= l) return;
        if (left <= l && r <= right) item[k] = updateFunc(item[k], value);
        else
        {
            Update(left, right, Left(k), l, (l + r) >> 1, value);
            Update(left, right, Right(k), (l + r) >> 1, r, value);
        }
    }
    public void All_Update()
    {
        for (int i = num - 2; i >= 0; i--)
            item[i] = func(item[Left(i)], item[Right(i)]);
    }
    public T Query(int index)
    {
        index += num - 1;
        var value = func(init, item[index]);
        while (index > 0)
        {
            index = Parent(index);
            value = func(value, item[index]);
        }
        return value;
    }
    //[left,right)
    public virtual T Query(int left, int right)
        => Query(left, right, 0, 0, num);
    protected virtual T Query(int left, int right, int k, int l, int r)
    {
        if (r <= left || right <= l) return init;
        if (left <= l && r <= right) return item[k];
        else
            return func(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r));
    }
}

public class Input
{
    public static string read => ReadLine().Trim();
    public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
    public static int num => ToInt32(read);
    public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
    public static long numL => ToInt64(read);
    public static T[] create<T>(int n, Func<int, T> f)
        => Enumerable.Repeat(0, n).Select(f).ToArray();
    public static char[][] grid(int h)
        => create(h, _ => read.ToCharArray());
    public static int[] ar1D(int n)
        => create(n, _ => num);
    public static long[] arL1D(int n)
        => create(n, _ => numL);
    public static string[] strs(int n)
        => create(n, _ => read);
    public static int[][] ar2D(int n)
        => create(n, _ => ar);
    public static long[][] arL2D(int n)
        => create(n, _ => arL);
    public static List<T>[] edge<T>(int n)
        => create(n, _ => new List<T>());
    public static T GetValue<T>(string g)
    {
        var t = typeof(T);
        if (t == typeof(int))
            return (T)(object)int.Parse(g);
        if (t == typeof(long))
            return (T)(object)long.Parse(g);
        if (t == typeof(string))
            return (T)(object)g;
        if (t == typeof(char))
            return (T)(object)char.Parse(g);
        if (t == typeof(double))
            return (T)(object)double.Parse(g);
        if (t == typeof(bool))
            return (T)(object)bool.Parse(g);
        return default(T);
    }
    public static void Make<T1, T2>(out T1 v1, out T2 v2)
    {
        v1 = Next<T1>();
        v2 = Next<T2>();
    }
    public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
    {
        Make(out v1, out v2);
        v3 = Next<T3>();
    }
    public static 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 static 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 static 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>();
    }
    private static Queue<string> sc;
    public static T Next<T>() { sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue<T>(sc.Dequeue()); }
    public static void Next<T>(ref T val) => val = Next<T>();
    public const long Inf = (long)1e18;
    public const double eps = 1e-6;
    public const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public const int MOD = 1000000007;
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1 { get; set; }
    public T2 v2 { get; set; }
    public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
    public override bool Equals(object obj)
        => this == (Pair<T1, T2>)obj;
    public override int GetHashCode()
        => v1.GetHashCode() ^ v2.GetHashCode();
    public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 0;
    public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 0;
    public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 1;
    public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != -1;
    public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == -1;
    public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 1;
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3 { get; set; }
    public Pair() : base() { v3 = Input.Next<T3>(); }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString()
        => $"{base.ToString()} {v3.ToString()}";
}

0