#166072 (C#(csc)) No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ

• 問題: No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
• ユーザー: 紙ぺーぱー
• 提出日時: 2017-04-15 02:28:19
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 347 ms / 5,000 ms
• コード長: 8,401 bytes
• コンパイル時間: 3,957 ms
• コンパイル使用メモリ: 112,816 KB
• 実行使用メモリ: 26,700 KB
• 最終ジャッジ日時: 2023-09-25 19:24:23
• 合計ジャッジ時間: 7,912 ms
• ジャッジサーバーID （参考情報）: judge14 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	51 ms; 20,644 KB
testcase_01	AC	52 ms; 20,676 KB
testcase_02	AC	52 ms; 20,608 KB
testcase_03	AC	51 ms; 22,604 KB
testcase_04	AC	51 ms; 22,748 KB
testcase_05	AC	51 ms; 18,568 KB
testcase_06	AC	63 ms; 20,620 KB
testcase_07	AC	52 ms; 20,776 KB
testcase_08	AC	54 ms; 20,632 KB
testcase_09	AC	181 ms; 22,376 KB
testcase_10	AC	129 ms; 20,684 KB
testcase_11	AC	123 ms; 25,284 KB
testcase_12	AC	185 ms; 22,416 KB
testcase_13	AC	69 ms; 22,652 KB
testcase_14	AC	116 ms; 24,664 KB
testcase_15	AC	216 ms; 24,688 KB
testcase_16	AC	268 ms; 24,712 KB
testcase_17	AC	347 ms; 26,700 KB
testcase_18	AC	170 ms; 24,668 KB
testcase_19	AC	225 ms; 24,656 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 Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var q = sc.Integer();
            var A = new LazyPropagationSegmentTree<int, int, SetSum>(n);
            var B = new LazyPropagationSegmentTree<int, int, SetSum>(n);
            var aaa = 0L;
            var bbb = 0L;
            for (int i = 0; i < q; i++)
            {
                var t = sc.Integer();
                var l = sc.Integer();
                var r = sc.Integer() + 1;
                if (t == 0)
                {
                    var a = A.Query(l, r);
                    var b = B.Query(l, r);
                    if (a > b)
                        aaa += a;
                    if (b > a)
                        bbb += b;
                }
                else
                {
                    A.Push(l, r, t & 1);
                    B.Push(l, r, (t & 2) / 2);
                }
            }
            aaa += A.Query(0, n);
            bbb += B.Query(0, n);
            IO.Printer.Out.WriteLine("{0} {1}", aaa, bbb);
        }

        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; }
    }

    struct SetSum: ILazyMonoid<int, int>
    {
        public int Identity
        {
            get
            {
                return 0;
            }
        }

        public int Zero
        {
            get
            {
                return 0;
            }
        }

        public int Apply(int l, int r, int val, int x)
        {
            return (r - l) * x;
        }

        public int Merge(int l, int r)
        {
            return l + r;
        }

        public int Push(int val, int x)
        {
            return x;
        }
    }
}

#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 Monoid
public interface IMonoid<T>
{
    T Merge(T l, T r);
    T Identity { get; }
}
#endregion
#region Lazy
public interface ILazyMonoid<T1, T2>: IMonoid<T1>
{
    T1 Apply(int l, int r, T1 val, T2 x);
    T2 Push(T2 val, T2 x);
    T2 Zero { get; }
}
#endregion

#region LazyPropagation Segment Tree
public class LazyPropagationSegmentTree<T1, T2, U>
    where U : struct, ILazyMonoid<T1, T2>
{
    int sz;
    int n;
    T1[] data;
    T2[] lazy;
    bool[] flag;
    U op;
    public LazyPropagationSegmentTree(int size)
    {
        sz = size;
        n = 1;
        while (n < size)
            n <<= 1;
        data = new T1[n * 2];
        lazy = new T2[n * 2];
        flag = new bool[n * 2];
        for (int i = 1; i < n * 2; i++)
        {
            data[i] = op.Identity;
            lazy[i] = op.Zero;
        }
    }
    private void lazyEval(int k, int a, int b)
    {
        if (!flag[k])
            return;
        push(a, (a + b) / 2, lazy[k], k * 2, a, (a + b) / 2);
        push((a + b) / 2, b, lazy[k], k * 2 + 1, (a + b) / 2, b);
        lazy[k] = op.Zero;
        flag[k] = false;
    }
    private void eval(int k)
    {
        data[k] = op.Merge(data[k * 2], data[k * 2 + 1]);
    }

    public void Push(int a, int b, T2 v)
    {
        push(a, b, v, 1, 0, n);
    }
    private void push(int a, int b, T2 x, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            flag[k] = true;
            lazy[k] = op.Push(lazy[k], x);
            data[k] = op.Apply(l, r, data[k], x);
        }
        else
        {
            lazyEval(k, l, r);
            push(a, b, x, k << 1, l, (l + r) >> 1);
            push(a, b, x, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    public T1 Query(int a, int b) { return query(a, b, 1, 0, n); }
    private T1 query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return op.Identity;
        if (a <= l && r <= b)
            return data[k];
        else
        {
            lazyEval(k, l, r);
            var vl = query(a, b, k << 1, l, (l + r) >> 1);
            var vr = query(a, b, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
            return op.Merge(vl, vr);
        }
    }
    public T1[] Items
    {
        get
        {
            var ret = new T1[sz];
            for (int i = 0; i < ret.Length; i++)
                ret[i] = Query(i, i + 1);
            return ret;
        }
    }
}
#endregion