結果

問題 No.631 Noelちゃんと電車旅行
ユーザー ひばちひばち
提出日時 2019-08-22 19:18:17
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 358 ms / 2,000 ms
コード長 9,726 bytes
コンパイル時間 1,164 ms
コンパイル使用メモリ 122,036 KB
実行使用メモリ 47,252 KB
最終ジャッジ日時 2024-04-10 07:57:09
合計ジャッジ時間 7,377 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 259 ms
29,856 KB
testcase_01 AC 354 ms
45,116 KB
testcase_02 AC 358 ms
45,144 KB
testcase_03 AC 357 ms
43,068 KB
testcase_04 AC 349 ms
47,252 KB
testcase_05 AC 352 ms
43,348 KB
testcase_06 AC 157 ms
34,996 KB
testcase_07 AC 103 ms
36,904 KB
testcase_08 AC 271 ms
43,404 KB
testcase_09 AC 313 ms
36,044 KB
testcase_10 AC 236 ms
38,484 KB
testcase_11 AC 215 ms
41,940 KB
testcase_12 AC 264 ms
43,316 KB
testcase_13 AC 254 ms
34,580 KB
testcase_14 AC 131 ms
29,900 KB
testcase_15 AC 214 ms
35,596 KB
testcase_16 AC 30 ms
27,332 KB
testcase_17 AC 30 ms
27,468 KB
testcase_18 AC 29 ms
25,328 KB
testcase_19 AC 30 ms
27,244 KB
testcase_20 AC 30 ms
25,292 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
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
{
    private static void chmin<T>(ref T num, T val) where T : IComparable<T>
        => num = num.CompareTo(val) == 1 ? val : num;
    private static void chmax<T>(ref T num, T val) where T : IComparable<T>
        => num = num.CompareTo(val) == -1 ? val : num;
    private static void swap<T>(ref T v1,ref T v2)
    { var t = v2;v2 = v1;v1 = t; }
    static void Main(string[] args)
    {
        var pr = new Program();
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        pr.Solve();
        Console.Out.Flush();
    }
    void Solve()
    {
        var num = Input.num;
        var ar = Input.ar;
        var seg = new StarrySkyTree(num-1, 0);
        for (var i = 0; i < num - 1; i++)
            seg[i] = ar[i] + (num - 1 - i) * 3;
        seg.All_Update();
        var m = Input.num;
        while (m-- > 0)
        {
            var abc = Input.ar;
            seg.Update(abc[0] - 1, abc[1], abc[2]);
            WriteLine(seg.Query(0, num));
        }
    }
}

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()}";
}

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)
    {
        _func = func;
        _num = 1;
        _init = init;
        this.updateFunc = updateFunc ?? ((T val1, T val2) => val2);
        while (_num <= num)
            _num *= 2;
        item = new T[2 * _num - 1];
        for (var i = 0; i < 2 * _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 StarrySkyTree : SegmentTree<long>
{//RSQ,RMQ
    private long[] lazy;
    public StarrySkyTree(int num, long init = 0) : base(num, init, Max, (a, b) => a + b)
    {
        lazy = new long[2 * _num - 1];
        for (var i = 0; i < num; i++)
            lazy[i] = init;
    }
    public override void Update(int left, int right, long value)
        => Update(left, right, 0, 0, _num, value);
    protected override void Update(int left, int right, int k, int l, int r, long value)
    {
        if (r <= left || right <= l) return;
        if (left <= l && r <= right) { lazy[k] += value; return; }
        Update(left, right, Left(k), l, (l + r) >> 1, value);
        Update(left, right, Right(k), (l + r) >> 1, r, value);
        item[k] = _func(item[Left(k)] + lazy[Left(k)], item[Right(k)] + lazy[Right(k)]);
    }
    public override long Query(int left, int right)
        => Query(left, right, 0, 0, _num);
    protected override long Query(int left, int right, int k, int l, int r)
    {
        if (r <= left || right <= l) return 0;
        if (left <= l && r <= right) return item[k] + lazy[k];
        return _func(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r)) + lazy[k];
    }
}
0