結果

問題 No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー eitahoeitaho
提出日時 2015-06-23 16:59:02
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 215 ms / 5,000 ms
コード長 4,729 bytes
コンパイル時間 3,582 ms
コンパイル使用メモリ 109,696 KB
実行使用メモリ 31,360 KB
最終ジャッジ日時 2024-07-07 17:11:27
合計ジャッジ時間 5,961 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
19,072 KB
testcase_01 AC 24 ms
19,072 KB
testcase_02 AC 25 ms
19,072 KB
testcase_03 AC 25 ms
19,200 KB
testcase_04 AC 30 ms
19,200 KB
testcase_05 AC 32 ms
19,584 KB
testcase_06 AC 38 ms
21,460 KB
testcase_07 AC 26 ms
19,328 KB
testcase_08 AC 30 ms
20,096 KB
testcase_09 AC 114 ms
27,392 KB
testcase_10 AC 165 ms
27,520 KB
testcase_11 AC 83 ms
24,960 KB
testcase_12 AC 114 ms
27,392 KB
testcase_13 AC 45 ms
22,176 KB
testcase_14 AC 144 ms
28,160 KB
testcase_15 AC 206 ms
28,416 KB
testcase_16 AC 215 ms
29,824 KB
testcase_17 AC 202 ms
31,360 KB
testcase_18 AC 198 ms
31,360 KB
testcase_19 AC 148 ms
28,672 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.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

class Program
{
    public void Solve()
    {
        int N = Reader.Int(), Q = Reader.Int();
        var Qs = Reader.IntTable(Q);
        var A = new RangeUpdateSegTree(N);
        var B = new RangeUpdateSegTree(N);
        long scoreA = 0, scoreB = 0;

        for (int qi = 0; qi < Q; qi++)
        {
            var q = Qs[qi];
            int L = q[1], R = q[2] + 1;
            if (q[0] == 0)
            {
                int countA = A.Sum(L, R);
                int countB = B.Sum(L, R);
                if (countA > countB) scoreA += countA;
                if (countB > countA) scoreB += countB;
            }
            else if (q[0] == 1)
            {
                A.Update(L, R, 1);
                B.Update(L, R, 0);
            }
            else
            {
                B.Update(L, R, 1);
                A.Update(L, R, 0);
            }
        }

        scoreA += A.Sum(0, N);
        scoreB += B.Sum(0, N);

        Console.WriteLine(scoreA + " " + scoreB);
    }



    class RangeUpdateSegTree
    {
        public readonly int N;
        private readonly int[] V, S;
        private readonly bool[] Flag;

        public RangeUpdateSegTree(int n)
        {
            for (N = 4; N < n; ) N *= 2;
            V = new int[N * 2];
            S = new int[N * 2];
            Flag = new bool[N * 2];
        }

        public int Sum(int L, int R) { return Sum(0, 0, N, L, R); }
        private int Sum(int i, int currL, int currR, int L, int R)
        {
            if (currL >= R || currR <= L) return 0;
            if (currL >= L && currR <= R) return S[i];
            if (Flag[i]) return V[i] * (Math.Min(currR, R) - Math.Max(currL, L));
            int mid = (currL + currR) / 2;
            int valL = Sum(i * 2 + 1, currL, mid, L, R);
            int valR = Sum(i * 2 + 2, mid, currR, L, R);
            return valL + valR;
        }

        public void Update(int L, int R, int val) { Update(0, val, 0, N, L, R); }
        private void Update(int i, int val, int currL, int currR, int L, int R)
        {
            if (currL >= R || currR <= L) return;
            if (currL >= L && currR <= R)
            {
                Flag[i] = true;
                V[i] = val;
                S[i] = val * (currR - currL);
                return;
            }
            if (Flag[i] && currR - currL > 1)
            {
                V[i * 2 + 1] = V[i * 2 + 2] = V[i];
                S[i * 2 + 1] = S[i * 2 + 2] = (currR - currL) / 2 * V[i];
                Flag[i * 2 + 1] = Flag[i * 2 + 2] = true;
                Flag[i] = false;
            }
            int mid = (currL + currR) / 2;
            Update(i * 2 + 1, val, currL, mid, L, R);
            Update(i * 2 + 2, val, mid, currR, L, R);
            S[i] = S[i * 2 + 1] + S[i * 2 + 2];
        }
    }


}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0