結果

問題 No.649 ここでちょっとQK！
ユーザー くれちーくれちー
提出日時 2018-02-16 00:04:11
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 660 ms / 3,000 ms
コード長 12,189 bytes
コンパイル時間 1,268 ms
コンパイル使用メモリ 124,416 KB
実行使用メモリ 40,216 KB
最終ジャッジ日時 2024-06-09 12:33:19
合計ジャッジ時間 14,724 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
27,100 KB
testcase_01 AC 35 ms
25,064 KB
testcase_02 AC 36 ms
27,220 KB
testcase_03 AC 175 ms
27,600 KB
testcase_04 AC 649 ms
39,584 KB
testcase_05 AC 630 ms
39,712 KB
testcase_06 AC 656 ms
36,988 KB
testcase_07 AC 35 ms
26,984 KB
testcase_08 AC 35 ms
27,216 KB
testcase_09 AC 35 ms
27,088 KB
testcase_10 AC 34 ms
22,968 KB
testcase_11 AC 36 ms
27,236 KB
testcase_12 AC 343 ms
33,796 KB
testcase_13 AC 337 ms
33,500 KB
testcase_14 AC 328 ms
31,744 KB
testcase_15 AC 340 ms
35,552 KB
testcase_16 AC 337 ms
33,816 KB
testcase_17 AC 368 ms
34,608 KB
testcase_18 AC 406 ms
36,800 KB
testcase_19 AC 431 ms
33,372 KB
testcase_20 AC 456 ms
35,500 KB
testcase_21 AC 493 ms
36,308 KB
testcase_22 AC 535 ms
38,428 KB
testcase_23 AC 561 ms
39,036 KB
testcase_24 AC 581 ms
38,316 KB
testcase_25 AC 626 ms
40,216 KB
testcase_26 AC 660 ms
38,752 KB
testcase_27 AC 38 ms
25,208 KB
testcase_28 AC 35 ms
25,096 KB
testcase_29 AC 36 ms
27,140 KB
testcase_30 AC 210 ms
32,908 KB
testcase_31 AC 206 ms
34,696 KB
testcase_32 AC 34 ms
26,860 KB
testcase_33 AC 34 ms
25,196 KB
testcase_34 AC 34 ms
25,204 KB
testcase_35 AC 30 ms
24,828 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.Convert;
using static System.Math;
using static Constants;
using static Extensions;
using static MathExtensions;

public static class Program
{
    public static void Solve()
    {
        var (q, k) = (I, I);
        var t = new long[q];
        var v = new List<long>(q);
        foreach (var i in Range(q))
        {
            t[i] = I;
            if (t[i] == 1) v.Add(L);
        }

        var vcc = new CoordinateCompressor<long>(v);
        var ft = new FenwickTree<int, SumGroup_Int32>(v.Count);
        var vi = 0;
        foreach (var i in Range(q))
        {
            if (t[i] == 1)
            {
                ft.Append(vcc.Compress(v[vi]), 1);
                vi++;
            }
            else if (t[i] == 2)
            {
                var ki = ft.LowerBound(k);
                if (ki < v.Count)
                {
                    Console.WriteLine(vcc.Decompress(ki));
                    ft.Append(ki, -1);
                }
                else Console.WriteLine(-1);
            }
            else Assert(false);
        }
    }

    #region Scanners
    static TextScanner _ts;
    static char C => char.Parse(_ts.Next());
    static string S => _ts.Next();
    static int I => int.Parse(_ts.Next());
    static long L => long.Parse(_ts.Next());
    static BigInteger B => BigInteger.Parse(_ts.Next());
    static double D => double.Parse(_ts.Next());
    static decimal M => decimal.Parse(_ts.Next());
    #endregion

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

public static partial class Extensions
{
}

#pragma warning disable
#region Library
public class CoordinateCompressor<T> 
    where T : IComparable<T>, IEquatable<T>
{
    private readonly Dictionary<T, int> _compress;
    private readonly T[] _decompress;

    public CoordinateCompressor(IEnumerable<T> coordinates)
    {
        var arr = coordinates.ToArray();
        Array.Sort(arr);
        _compress = new Dictionary<T, int>(arr.Length);
        _decompress = arr;
        var pi = default(int);
        var pa = default(T);
        if (arr.Any()) _compress.Add(arr[0], 0);

        for (var i = 0; i < arr.Length; i++)
            if (i > 0 && !arr[i].Equals(pa)) _compress[pa = arr[i]] = pi = i;
    }

    public int Compress(T coordinate) => _compress[coordinate];

    public T Decompress(int index) => _decompress[index];
}

public interface IMonoid<T>
{
    T Unit { get; }
    T Append(T left, T right);
}

public interface IGroup<T> : IMonoid<T>
{
    T Invert(T value);
}

public interface ICommutativeMonoid<T> : IMonoid<T>
{
}

public interface ICommutativeGroup<T> : IGroup<T>, ICommutativeMonoid<T>
{
}

public struct SumGroup_Int32 : ICommutativeGroup<int>
{
    public int Unit => 0;
    public int Append(int left, int right) => left + right;
    public int Invert(int value) => -value;
}

public class FenwickTreeOnMonoid<T, TMonoid>
    where TMonoid : struct, ICommutativeMonoid<T>
{
    [DebuggerBrowsable(DebuggerBrowsableState.Never)]
    protected static readonly TMonoid _monoid = default(TMonoid);
    protected readonly T[] _tree;

    public FenwickTreeOnMonoid(int length)
    {
        _tree = Enumerable.Repeat(_monoid.Unit, length + 1).ToArray();
    }

    public FenwickTreeOnMonoid(IReadOnlyList<T> collection)
    {
        var count = collection.Count;
        _tree = new T[count + 1];
        for (var i = 0; i < count; i++) _tree[i + 1] = collection[i];
        for (var i = 1; i < count; i++)
        {
            var j = i + (i & -i);
            if (j < count + 1) _tree[j] = _monoid.Append(_tree[j], _tree[i]);
        }
    }

    public int Length => _tree.Length - 1;

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

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

public partial class FenwickTree<T, TGroup> : FenwickTreeOnMonoid<T, TGroup>
    where TGroup : struct, ICommutativeGroup<T>
{
    [DebuggerBrowsable(DebuggerBrowsableState.Never)]
    protected static readonly TGroup _group = default(TGroup);

    public FenwickTree(int length) : base(length) { }

    public FenwickTree(IReadOnlyList<T> collection) : base(collection) { }

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

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

    // for debug
    [DebuggerBrowsable(DebuggerBrowsableState.RootHidden)]
    internal IEnumerable<T> Values
    {
        get { for (var i = 0; i < this.Length; i++) yield return this[i]; }
    }
}

public partial class FenwickTree<T, TGroup>
{
    public int LowerBound(T value) => this.LowerBound(value, Comparer<T>.Default);

    public int LowerBound(T value, IComparer<T> comparer)
    {
        if (this.Length == 0 || comparer.Compare(value, this[0]) <= 0) return 0;
        var x = 0;
        for (var i = HighestOneBit(this.Length); i > 0; i >>= 1)
        {
            if (x + i <= this.Length && comparer.Compare(_tree[x + i], value) < 0)
            {
                value = _group.Append(value, _group.Invert(_tree[x + i]));
                x += i;
            }
        }
        return x;
    }
}

public class TextScanner
{
    private readonly TextReader _tr;

    public TextScanner(TextReader tr)
    {
        _tr = tr;
    }

    public string Next()
    {
        var sb = new StringBuilder();
        int i;
        do
        {
            i = _tr.Read();
            if (i == -1) throw new EndOfStreamException();
        }
        while (char.IsWhiteSpace((char)i));
        while (i != -1 && !char.IsWhiteSpace((char)i))
        {
            sb.Append((char)i);
            i = _tr.Read();
        }
        return sb.ToString();
    }
}

public static class Constants
{
    public const int AnswerToLifeTheUniverseAndEverything = 42;
    public const string Yes = nameof(Yes);
    public const string No = nameof(No);
    public const string YES = nameof(YES);
    public const string NO = nameof(NO);
    public const string Possible = nameof(Possible);
    public const string Impossible = nameof(Impossible);
}

[DebuggerStepThrough]
public static partial class Extensions
{
    public static void Answer(object value)
    {
        Console.WriteLine(value);
        Exit(0);
    }

    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 Dictionary<T, int> Bucket<T>(this IEnumerable<T> source) where T : IEquatable<T>
    {
        var dict = new Dictionary<T, int>();
        foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1;
        return dict;
    }

    public static int[] Bucket<T>(this IEnumerable<T> source, int maxValue, Func<T, int> selector)
    {
        var arr = new int[maxValue + 1];
        foreach (var item in source) arr[selector(item)]++;
        return arr;
    }

    public static IComparer<T> CreateDescendingComparer<T>()
        where T : IComparable<T>
        => Comparer<T>.Create((x, y) => y.CompareTo(x));

    public static IEnumerable<int> CumSum(this IEnumerable<int> source)
    {
        var sum = 0;
        foreach (var item in source) yield return sum += item;
    }

    public static IEnumerable<long> CumSum(this IEnumerable<long> source)
    {
        var sum = 0L;
        foreach (var item in source) yield return sum += item;
    }

    public static void Exit(int exitCode)
    {
        Console.Out.Flush();
        Environment.Exit(exitCode);
    }

    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 T Identity<T>(this T item) => item;

    public static IEnumerable<int> Range(int start, int end, int step = 1)
    {
        for (var i = start; i < end; i += step) yield return i;
    }

    public static IEnumerable<int> Range(int end) => Range(0, end);

    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>(int count, Func<T> func)
    {
        for (var i = 0; i < count; i++) yield return func();
    }

    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;
    }
}

[DebuggerStepThrough]
public static class MathExtensions
{
    public static int DivCeil(int left, int right)
        => left / right + (left % right == 0 ? 0 : 1);

    public static long DivCeil(long left, long right)
        => left / right + (left % right == 0L ? 0L : 1L);

    public static int Gcd(int left, int right)
    {
        int r;
        while ((r = left % right) != 0) { left = right; right = r; }
        return right;
    }

    public static long Gcd(long left, long right)
    {
        long r;
        while ((r = left % right) != 0L) { left = right; right = r; }
        return right;
    }

    public static BigInteger Gcd(BigInteger left, BigInteger right)
        => BigInteger.GreatestCommonDivisor(left, right);

    public static int HighestOneBit(int x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        return x - (x >> 1);
    }

    public static long HighestOneBit(long x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        x |= x >> 32;
        return x - (x >> 1);
    }

    public static int Lcm(int left, int right) => left / Gcd(left, right) * right;

    public static long Lcm(long left, long right) => left / Gcd(left, right) * right;

    public static BigInteger Lcm(BigInteger left, BigInteger right)
        => left / Gcd(left, right) * right;

    public static int Pow(int value, int exponent)
    {
        var r = 1;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Pow(long value, int exponent)
    {
        var r = 1L;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Fact(int value)
    {
        var r = 1L;
        for (var i = 2; i <= value; i++) r *= i;
        return r;
    }
}
#endregion
0