結果

問題 No.833 かっこいい電車
ユーザー EmKjpEmKjp
提出日時 2019-05-24 23:33:20
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 393 ms / 2,000 ms
コード長 4,830 bytes
コンパイル時間 2,991 ms
コンパイル使用メモリ 110,092 KB
実行使用メモリ 38,640 KB
最終ジャッジ日時 2023-09-14 20:57:45
合計ジャッジ時間 9,535 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 393 ms
28,228 KB
testcase_01 AC 56 ms
20,648 KB
testcase_02 AC 57 ms
22,928 KB
testcase_03 AC 58 ms
20,768 KB
testcase_04 AC 57 ms
20,736 KB
testcase_05 AC 57 ms
20,648 KB
testcase_06 AC 58 ms
20,768 KB
testcase_07 AC 56 ms
20,736 KB
testcase_08 AC 56 ms
20,836 KB
testcase_09 AC 56 ms
20,684 KB
testcase_10 AC 259 ms
31,944 KB
testcase_11 AC 307 ms
36,260 KB
testcase_12 AC 139 ms
31,592 KB
testcase_13 AC 131 ms
26,204 KB
testcase_14 AC 249 ms
38,396 KB
testcase_15 AC 157 ms
31,000 KB
testcase_16 AC 118 ms
34,936 KB
testcase_17 AC 167 ms
25,404 KB
testcase_18 AC 300 ms
32,072 KB
testcase_19 AC 120 ms
34,064 KB
testcase_20 AC 74 ms
22,856 KB
testcase_21 AC 289 ms
28,144 KB
testcase_22 AC 160 ms
37,292 KB
testcase_23 AC 129 ms
34,368 KB
testcase_24 AC 163 ms
38,640 KB
testcase_25 AC 301 ms
33,348 KB
testcase_26 AC 131 ms
36,476 KB
testcase_27 AC 221 ms
31,832 KB
testcase_28 AC 193 ms
32,052 KB
testcase_29 AC 201 ms
32,580 KB
testcase_30 AC 181 ms
35,876 KB
testcase_31 AC 379 ms
28,132 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.Globalization;
using System.IO;
using System.Linq;

partial class Solver
{
    public void Run()
    {
        var N = ni();
        var Q = ni();
        var A = ni(N);

        var connectTree = new BinaryIndexTree(N);
        var attractiveTree = new BinaryIndexTree(N);
        for (int i = 0; i < N; i++)
        {
            attractiveTree.Add(i, A[i]);
        }

        for (int i = 0; i < Q; i++)
        {
            var q = ni();
            var x = ni() - 1;
            switch (q)
            {
                case 1: // connect
                    if (connectTree.Sum(x, x) == 0)
                        connectTree.Add(x, 1);
                    break;
                case 2:
                    if (connectTree.Sum(x, x) == 1)
                        connectTree.Add(x, -1);
                    break;
                case 3:
                    attractiveTree.Add(x, 1);
                    break;
                case 4:
                    {
                        var lower = x;
                        var upper = x;
                        for (int d = (1 << 20); d > 0; d >>= 1)
                        {
                            if (lower - d >= 0 && connectTree.Sum(lower - d, x - 1) == x - (lower - d))
                            {
                                lower -= d;
                            }
                            if (upper + d < N && connectTree.Sum(upper, upper + d - 1) == (upper + d) - upper)
                            {
                                upper += d;
                            }
                        }
                        cout.WriteLine(attractiveTree.Sum(lower, upper));
                    }
                    break;
            }
        }
    }
}

public class BinaryIndexTree
{
    private long[] array;
    public BinaryIndexTree(int size)
    {
        array = new long[size];
    }
    public long Sum(long a, long b)
    { // [a,b]
        if (a != 0) return Sum(0, b) - Sum(0, a - 1);
        long val = 0;
        for (; b >= 0; b = (b & (b + 1)) - 1) val += array[b];
        return val;
    }

    public void Add(int k, long val)
    {
        for (; k < array.Length; k |= k + 1)
            array[k] += val;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0