結果

問題 No.833 かっこいい電車
ユーザー EmKjpEmKjp
提出日時 2019-05-24 22:27:21
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 933 ms / 2,000 ms
コード長 6,707 bytes
コンパイル時間 2,967 ms
コンパイル使用メモリ 121,692 KB
実行使用メモリ 40,320 KB
最終ジャッジ日時 2024-07-02 03:44:27
合計ジャッジ時間 15,284 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 933 ms
30,592 KB
testcase_01 AC 27 ms
18,048 KB
testcase_02 AC 27 ms
17,920 KB
testcase_03 AC 27 ms
17,664 KB
testcase_04 AC 26 ms
17,920 KB
testcase_05 AC 27 ms
17,920 KB
testcase_06 AC 26 ms
17,920 KB
testcase_07 AC 27 ms
17,664 KB
testcase_08 AC 26 ms
17,920 KB
testcase_09 AC 25 ms
17,792 KB
testcase_10 AC 646 ms
32,256 KB
testcase_11 AC 838 ms
39,296 KB
testcase_12 AC 248 ms
29,696 KB
testcase_13 AC 201 ms
24,704 KB
testcase_14 AC 617 ms
39,040 KB
testcase_15 AC 295 ms
31,360 KB
testcase_16 AC 141 ms
33,536 KB
testcase_17 AC 267 ms
23,168 KB
testcase_18 AC 801 ms
32,512 KB
testcase_19 AC 162 ms
32,256 KB
testcase_20 AC 49 ms
22,016 KB
testcase_21 AC 724 ms
27,264 KB
testcase_22 AC 283 ms
40,320 KB
testcase_23 AC 199 ms
32,768 KB
testcase_24 AC 307 ms
39,552 KB
testcase_25 AC 781 ms
31,744 KB
testcase_26 AC 199 ms
37,120 KB
testcase_27 AC 501 ms
32,256 KB
testcase_28 AC 413 ms
26,752 KB
testcase_29 AC 446 ms
30,976 KB
testcase_30 AC 194 ms
39,040 KB
testcase_31 AC 495 ms
30,464 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 AnonymousSegmentTree<long>((a, b) => a + b);
        connectTree.Build(N, a => 0);
        var attractiveTree = new AnonymousSegmentTree<long>((a, b) => a + b);
        attractiveTree.Build(N, a => A[a]);

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

public abstract class SegmentTree<TNodeValue> where TNodeValue : struct
{
    protected int N { get; private set; }
    protected TNodeValue?[] node;
    protected static int Left(int p) { return p * 2 + 1; }
    protected static int Right(int p) { return p * 2 + 2; }

    public SegmentTree() { }

    public void Build(IList<TNodeValue> array)
    {
        Build(array.Count, i => array[i]);
    }

    virtual public void Build(int _n, Func<int, TNodeValue> create)
    {
        N = 1;
        while (N < _n) N *= 2;
        node = new TNodeValue?[2 * N];

        for (int i = 0; i < _n; i++) node[i + N - 1] = create(i);
        for (int i = N - 2; i >= 0; i--) node[i] = Merge(node[Left(i)], node[Right(i)]);
    }

    protected TNodeValue? Merge(TNodeValue? left, TNodeValue? right)
    {
        if (left != null && right != null) return Merge(left.Value, right.Value);
        if (left == null) return right;
        if (right == null) return left;
        return null;
    }

    protected abstract TNodeValue Merge(TNodeValue left, TNodeValue right);

    public void Update(int index, TNodeValue val)
    {
        int p = index + N - 1;
        node[p] = val;
        while (p > 0)
        {
            p = (p - 1) / 2;
            node[p] = Merge(node[Left(p)], node[Right(p)]);
        }
    }

    protected virtual TNodeValue? Query(int begin, int end, int k, int l, int r)
    {
        if (r <= begin || end <= l) return null;
        if (begin <= l && r <= end) return node[k];
        int mid = (l + r) / 2;
        return Merge(
            Query(begin, end, Left(k), l, mid),
            Query(begin, end, Right(k), mid, r)
        );
    }

    public TNodeValue Query(int begin, int end)
    {
        return Query(begin, end, 0, 0, N).Value;
    }
};

public class RMQSegmentTree : SegmentTree<int>
{
    protected override int Merge(int x, int y)
    {
        return Math.Max(x, y);
    }
}

public class AnonymousSegmentTree<TNodeValue> : SegmentTree<TNodeValue> where TNodeValue : struct
{
    readonly Func<TNodeValue, TNodeValue, TNodeValue> _mergeMethod;

    public AnonymousSegmentTree(Func<TNodeValue, TNodeValue, TNodeValue> merge)
    {
        _mergeMethod = merge;
    }

    protected override TNodeValue Merge(TNodeValue left, TNodeValue right)
    {
        return _mergeMethod(left, right);
    }
}

// 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