結果

問題 No.59 鉄道の旅
ユーザー くれちーくれちー
提出日時 2017-11-04 20:51:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 83 ms / 5,000 ms
コード長 10,729 bytes
コンパイル時間 4,381 ms
コンパイル使用メモリ 118,920 KB
実行使用メモリ 26,728 KB
最終ジャッジ日時 2023-08-15 17:10:15
合計ジャッジ時間 4,795 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
26,728 KB
testcase_01 AC 55 ms
24,756 KB
testcase_02 AC 55 ms
24,752 KB
testcase_03 AC 55 ms
24,608 KB
testcase_04 AC 75 ms
22,700 KB
testcase_05 AC 55 ms
24,684 KB
testcase_06 AC 57 ms
24,740 KB
testcase_07 AC 57 ms
24,672 KB
testcase_08 AC 58 ms
26,660 KB
testcase_09 AC 56 ms
24,616 KB
testcase_10 AC 58 ms
22,708 KB
testcase_11 AC 56 ms
24,840 KB
testcase_12 AC 63 ms
26,724 KB
testcase_13 AC 74 ms
24,672 KB
testcase_14 AC 83 ms
24,700 KB
testcase_15 AC 54 ms
24,864 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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Math;
using static System.Linq.Enumerable;
using static Extentions;

public static class Program
{
    public static void Solve()
    {
        const int wMax = 1000000;

        var (n, k) = (I, I);
        var ft = new FenwickTree<int>(wMax + 1, Group.Sum_Int32);

        Repeat(n, () =>
        {
            var w = I;
            if (w > 0 && ft[w, wMax] < k) ft[w]++;
            if (w < 0 && ft[-w] > 0) ft[-w]--;
        });

        Console.WriteLine(ft.ConcatTo(wMax));
    }

    #region Scanners
    static Scanner _scanner;
    static char C => _scanner.NextChar();
    static string S => _scanner.NextString();
    static int I => _scanner.NextInt();
    static long L => _scanner.NextLong();
    static BigInteger B => _scanner.NextBigInteger();
    static double D => _scanner.NextDouble();
    static decimal M => _scanner.NextDecimal();
    #endregion

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

public static partial class Extentions
{
}

#region Library
// not tested
public class Scanner
{
    private readonly Stream _stream;
    private const int _bufferSize = 1024;
    private readonly byte[] _buf = new byte[_bufferSize];
    private int _len, _ptr;

    public Scanner(Stream stream)
    {
        _stream = stream;
    }

    public byte ReadByte()
    {
        if (_ptr >= _len) { _len = _stream.Read(_buf, 0, 1024); _ptr = 0; }
        return _buf[_ptr++];
    }

    public char ReadChar() => (char)ReadByte();

    public string ReadLine()
    {
        var r = new StringBuilder();
        if (_ptr == 0) r.Append(ReadChar());
        for (; _ptr < _len; _ptr++) r.Append((char)_buf[_ptr]);
        return r.ToString();
    }

    public char NextChar() => char.Parse(NextString());

    public string NextString()
    {
        var r = new StringBuilder();
        var b = ReadChar();
        while (b != ' ' && b != '\n') { r.Append(b); b = ReadChar(); }
        return r.ToString();
    }

    public int NextInt() => (int)NextLong();

    public long NextLong()
    {
        var r = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != ' ' && b != '\n') { r = r * 10 + b - '0'; b = ReadByte(); }
        return n ? -r : r;
    }

    public BigInteger NextBigInteger()
    {
        var r = new BigInteger();
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != ' ' && b != '\n') { r = r * 10 + b - '0'; b = ReadByte(); }
        return n ? -r : r;
    }

    public double NextDouble()
    {
        var i = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != '.') { i = i * 10 + b - '0'; b = ReadByte(); }
        b = ReadByte();
        var f = 0L;
        var p = 0;
        while (b != ' ' && b != '\n') { f = f * 10 + b - '0'; b = ReadByte(); p++; }
        var r = i + (double)f / Pow(10, p);
        return n ? -r : r;
    }

    public decimal NextDecimal() => decimal.Parse(NextString());

    public T Next<T>(Func<string, T> parser) => parser(NextString());
}

public class Monoid<T>
{
    public Monoid(T unit, Func<T, T, T> append)
    {
        this.Unit = unit;
        this.Append = append;
    }

    public T Unit { get; }

    public Func<T, T, T> Append { get; }
}

public static class Monoid
{
    public static Monoid<T> Create<T>(T unit, Func<T, T, T> append) => new Monoid<T>(unit, append);

    public static Monoid<int> Sum_Int32 => new Monoid<int>(0, (x, y) => x + y);

    public static Monoid<int> Min_Int32 => new Monoid<int>(int.MaxValue, Min);

    public static Monoid<int> Max_Int32 => new Monoid<int>(int.MinValue, Max);
}

public class Group<T> : Monoid<T>
{
    public Group(T unit, Func<T, T, T> append, Func<T, T> invert) : base(unit, append)
    {
        this.Invert = invert;
    }

    public Func<T, T> Invert { get; }
}

public static class Group
{
    public static Group<T> Create<T>(T unit, Func<T, T, T> append, Func<T, T> invert)
        => new Group<T>(unit, append, invert);

    public static Group<int> Sum_Int32 => new Group<int>(0, (x, y) => x + y, x => -x);
}

public class FenwickTree<T> : IEnumerable<T>, IReadOnlyList<T>
{
    private readonly T[] _tree;
    private readonly Monoid<T> _monoid;
    private readonly Group<T> _group;

    public FenwickTree(int length, Monoid<T> monoid)
    {
        _tree = Repeat(monoid.Unit, length + 1).ToArray();
        _monoid = monoid;
    }

    public FenwickTree(int length, Group<T> group) : this(length, (Monoid<T>)group)
    {
        _group = group;
    }

    public FenwickTree(IEnumerable<T> collection, Monoid<T> monoid)
    {
        var count = collection.Count();
        _monoid = monoid;
        _tree = new T[count + 1];
        collection.ForEach((x, i) => { _tree[i + 1] = x; });
        for (var i = 1; i < count; i++)
        {
            var j = i + (i & -i);
            if (j < count) _tree[j] = monoid.Append(_tree[j], _tree[i]);
        }
    }

    public FenwickTree(IEnumerable<T> collection, Group<T> group) : this(collection, (Monoid<T>)group)
    {
        _group = group;
    }

    public int Length => _tree.Length - 1;

    int IReadOnlyCollection<T>.Count => this.Length;

    public T this[int i]
    {
        get => this[i, i];
        set => this.AppendAt(i, _group.Append(value, _group.Invert(this[i])));
    }

    public T this[int i, int j]
    {
        get
        {
            var r = _group.Unit;
            j++;
            for (; j > i; j -= j & -j) r = _group.Append(r, _tree[j]);
            for (; i > j; i -= i & -i) r = _group.Append(r, _group.Invert(_tree[i]));
            return r;
        }
    }

    public IEnumerator<T> GetEnumerator()
    {
        for (var i = 0; i < this.Length; i++) yield return ConcatTo(i);
    }

    IEnumerator IEnumerable.GetEnumerator() => this.GetEnumerator();

    public T ConcatTo(int i)
    {
        var r = _monoid.Unit;
        for (i++; i > 0; i -= i & -i) r = _monoid.Append(r, _tree[i]);
        return r;
    }

    public void AppendAt(int i, T value)
    {
        for (i++; i <= this.Length; i += i & -i) _tree[i] = _monoid.Append(_tree[i], value);
    }
}

public static partial class Extentions
{
    [DebuggerStepThrough]
    public static void Assert(bool condition)
    {
        if (!condition) throw new Exception("Assertion failed");
    }

    public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());

    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

    public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
    {
        var i = 0;
        foreach (var item in source) action(item, i++);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
    {
        var i = 0;
        foreach (var item in source) func(item, i++);
    }

    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    public static void Repeat(int count, Action<int> action)
    {
        for (var i = 0; i < count; i++) action(i);
    }

    public static IEnumerable<T> Repeat<T>(Func<T> func)
    {
        for (var i = 0; ; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<T> func)
    {
        for (var i = 0; i < count; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(Func<int, T> func)
    {
        for (var i = 0; ; i++) yield return func(i);
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func)
    {
        for (var i = 0; i < count; i++) yield return func(i);
    }

    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x; x = y; y = tmp;
    }

    public static (T1[], T2[]) Unzip<T1, T2>(this ICollection<(T1, T2)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var i = 0;
        foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; }
        return (ts1, ts2);
    }

    public static (T1[], T2[], T3[]) Unzip<T1, T2, T3>(this ICollection<(T1, T2, T3)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; }
        return (ts1, ts2, ts3);
    }

    public static (T1[], T2[], T3[], T4[]) Unzip<T1, T2, T3, T4>(this ICollection<(T1, T2, T3, T4)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var ts4 = new T4[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; }
        return (ts1, ts2, ts3, ts4);
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, Func<T1, T2, T3, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current);
        }
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T4, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, IEnumerable<T4> fourth, Func<T1, T2, T3, T4, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        using (var e4 = fourth.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current);
        }
    }
}
#endregion
0