結果

問題 No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-19 23:08:51
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 339 ms / 5,000 ms
コード長 7,137 bytes
コンパイル時間 2,579 ms
コンパイル使用メモリ 112,092 KB
実行使用メモリ 25,744 KB
最終ジャッジ日時 2023-09-21 10:08:12
合計ジャッジ時間 6,286 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
20,708 KB
testcase_01 AC 52 ms
20,604 KB
testcase_02 AC 53 ms
20,608 KB
testcase_03 AC 53 ms
20,744 KB
testcase_04 AC 54 ms
20,768 KB
testcase_05 AC 55 ms
20,604 KB
testcase_06 AC 63 ms
20,612 KB
testcase_07 AC 54 ms
20,568 KB
testcase_08 AC 54 ms
20,536 KB
testcase_09 AC 178 ms
22,124 KB
testcase_10 AC 129 ms
18,600 KB
testcase_11 AC 122 ms
21,136 KB
testcase_12 AC 177 ms
22,180 KB
testcase_13 AC 70 ms
20,604 KB
testcase_14 AC 114 ms
22,220 KB
testcase_15 AC 206 ms
22,272 KB
testcase_16 AC 258 ms
22,900 KB
testcase_17 AC 339 ms
25,732 KB
testcase_18 AC 168 ms
25,744 KB
testcase_19 AC 220 ms
23,680 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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var q = sc.Integer();
            var A = new LazyEvaluateSetSumTree(n);
            var B = new LazyEvaluateSetSumTree(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 if (t == 1)
                {
                    A.Set(l, r, 1);
                    B.Set(l, r, 0);
                }
                else
                {
                    A.Set(l, r, 0);
                    B.Set(l, r, 1);
                }
            }
            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; }
    }
}
#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 != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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 LazyEvalDirection
public class LazyEvaluateSetSumTree
{
    int n;
    int[] data;
    int[] lazy;
    public LazyEvaluateSetSumTree(int size)
    {
        n = 1;
        while (n < size)
            n <<= 1;
        data = new int[n << 1];
        lazy = new int[n << 1];
        for (int i = 0; i < lazy.Length; i++)
            lazy[i] = -1;
    }
    private void lazyEval(int k, int a, int b)
    {
        if (lazy[k] == -1)
            return;
        Update(a, (a + b) >> 1, lazy[k], k << 1, a, (a + b) >> 1);
        Update((a + b) >> 1, b, lazy[k], (k << 1) + 1, (a + b) >> 1, b);
        lazy[k] = -1;
    }
    private void eval(int k)
    {
        int l = k << 1, r = (k << 1) + 1;
        data[k] = data[l] + data[r];
    }
    public void Set(int a, int b, int v)
    {
        Update(a, b, v, 1, 0, n);
    }
    private void Update(int a, int b, int v, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            lazy[k] = v;
            if (v == 1)
                data[k] = r - l;
            else data[k] = 0;
        }
        else
        {
            lazyEval(k, l, r);
            Update(a, b, v, k << 1, l, (l + r) >> 1);
            Update(a, b, v, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    public int Query(int a, int b) { return Query(a, b, 1, 0, n); }
    private int 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
        {
            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 vl + vr;
        }
    }

}
#endregion
0