結果

問題 No.59 鉄道の旅
ユーザー くれちーくれちー
提出日時 2017-08-14 01:57:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 97 ms / 5,000 ms
コード長 4,923 bytes
コンパイル時間 1,115 ms
コンパイル使用メモリ 117,252 KB
実行使用メモリ 37,632 KB
最終ジャッジ日時 2024-10-13 09:24:57
合計ジャッジ時間 2,539 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
22,016 KB
testcase_01 AC 30 ms
22,016 KB
testcase_02 AC 29 ms
22,272 KB
testcase_03 AC 31 ms
22,144 KB
testcase_04 AC 97 ms
36,608 KB
testcase_05 AC 30 ms
22,144 KB
testcase_06 AC 34 ms
22,528 KB
testcase_07 AC 31 ms
22,144 KB
testcase_08 AC 41 ms
25,088 KB
testcase_09 AC 40 ms
24,960 KB
testcase_10 AC 40 ms
24,960 KB
testcase_11 AC 38 ms
24,448 KB
testcase_12 AC 70 ms
33,792 KB
testcase_13 AC 93 ms
37,632 KB
testcase_14 AC 97 ms
37,504 KB
testcase_15 AC 30 ms
22,144 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.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },
        StringSplitOptions.RemoveEmptyEntries);

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

interface IMonoid<T>
{
    T Mempty { get; }
    T Mappend(T a, T b);
}

class Monoid<T> : IMonoid<T>
{
    public T Mempty { get; private set; }
    public Func<T, T, T> mappend;
    public T Mappend(T a, T b) => mappend(a, b);

    public Monoid(T mempty, Func<T, T, T> mappend)
    {
        this.Mempty = mempty;
        this.mappend = mappend;
    }
}

class IntSumMonoid : IMonoid<int>
{
    public int Mempty => 0;
    public int Mappend(int a, int b) => a + b;
}

interface IGroup<T> : IMonoid<T>
{
    T InvMappend(T a, T b);
}

class IntSumGroup : IntSumMonoid, IGroup<int>
{
    public int InvMappend(int a, int b) => a - b;
}

class BinaryIndexedTree<T>
{
    T[] tree;

    public readonly int N;
    public readonly IMonoid<T> Monoid;
    readonly bool supportsGroup = false;
    
    // O(N)
    public BinaryIndexedTree(int n, IMonoid<T> monoid)
    {
        N = n;
        Monoid = monoid;
        tree = Enumerable.Repeat(monoid.Mempty, n + 1).ToArray();
    }

    // O(N)
    public BinaryIndexedTree(IEnumerable<T> collection, IMonoid<T> monoid)
    {
        N = collection.Count();
        Monoid = monoid;
        tree = new T[N + 1];
        for (var i = 0; i < N; i++) tree[i + 1] = collection.ElementAt(i);
        for (var i = 1; i < N; i++)
        {
            var j = i + (i & -i);
            if (j < N) tree[j] = monoid.Mappend(tree[j], tree[i]);
        }
    }

    // O(N)
    public BinaryIndexedTree(int n, IGroup<T> group)
        : this(n, (IMonoid<T>)group)
    {
        supportsGroup = true;
    }

    // O(N)
    public BinaryIndexedTree(IEnumerable<T> collection, IGroup<T> group)
        : this(collection, (IMonoid<T>)group)
    {
        supportsGroup = true;
    }

    public T this[int i]
    {
        // O(log N)
        get { return this[i, i]; }

        // O(log N)
        set
        {
            if (!supportsGroup) throw new InvalidOperationException();
            var group = (IGroup<T>)Monoid;
            Append(i, group.InvMappend(value, this[i]));
        }
    }

    public T this[int i, int j]
    {
        // O(log N)
        get
        {
            if (!supportsGroup) throw new InvalidOperationException();
            var group = (IGroup<T>)Monoid;
            var acc = group.Mempty;
            j++;
            for (; j > i; j -= j & -j) acc = group.Mappend(acc, tree[j]);
            for (; i > j; i -= i & -i) acc = group.InvMappend(acc, tree[i]);
            return acc;
        }
    }

    // O(log N)
    public T Concat(int i)
    {
        var acc = Monoid.Mempty;
        for (i++; i > 0; i -= i & -i) acc = Monoid.Mappend(acc, tree[i]);
        return acc;
    }

    // O(log N)
    public void Append(int i, T d)
    {
        for (i++; i <= N; i += i & -i) tree[i] = Monoid.Mappend(tree[i], d);
    }
}

static class Extentions
{
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO());
        Out.Flush();
    }

    static void Solve(IO io)
    {
        const int wMax = 1000000;

        var n = io.I;
        var k = io.I;
        var bit = new BinaryIndexedTree<int>(wMax + 1, new IntSumGroup());

        for (var i = 0; i < n; i++)
        {
            var w = io.I;
            if (w > 0 && bit[w, wMax] < k) bit[w]++;
            if (w < 0 && bit[-w] > 0) bit[-w]--;
        }

        io.Write(bit.Concat(wMax));
    }
}
0