結果

問題 No.649 ここでちょっとQK！
ユーザー sekiya9311sekiya9311
提出日時 2018-02-09 23:35:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 387 ms / 3,000 ms
コード長 9,710 bytes
コンパイル時間 2,607 ms
コンパイル使用メモリ 111,360 KB
実行使用メモリ 51,020 KB
最終ジャッジ日時 2024-10-09 03:03:58
合計ジャッジ時間 10,557 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
19,200 KB
testcase_01 AC 33 ms
19,456 KB
testcase_02 AC 33 ms
19,328 KB
testcase_03 AC 213 ms
26,496 KB
testcase_04 AC 358 ms
51,020 KB
testcase_05 AC 336 ms
51,016 KB
testcase_06 AC 328 ms
27,648 KB
testcase_07 AC 34 ms
19,328 KB
testcase_08 AC 35 ms
19,200 KB
testcase_09 AC 35 ms
19,200 KB
testcase_10 AC 34 ms
19,328 KB
testcase_11 AC 32 ms
19,328 KB
testcase_12 AC 209 ms
39,424 KB
testcase_13 AC 227 ms
39,296 KB
testcase_14 AC 218 ms
39,296 KB
testcase_15 AC 213 ms
39,424 KB
testcase_16 AC 205 ms
39,296 KB
testcase_17 AC 227 ms
40,192 KB
testcase_18 AC 247 ms
40,832 KB
testcase_19 AC 273 ms
40,576 KB
testcase_20 AC 279 ms
41,216 KB
testcase_21 AC 297 ms
41,856 KB
testcase_22 AC 316 ms
39,316 KB
testcase_23 AC 319 ms
39,924 KB
testcase_24 AC 356 ms
48,884 KB
testcase_25 AC 375 ms
49,436 KB
testcase_26 AC 387 ms
49,944 KB
testcase_27 AC 37 ms
19,968 KB
testcase_28 AC 35 ms
19,712 KB
testcase_29 AC 35 ms
19,968 KB
testcase_30 AC 179 ms
33,152 KB
testcase_31 AC 181 ms
33,024 KB
testcase_32 AC 32 ms
19,328 KB
testcase_33 AC 31 ms
19,456 KB
testcase_34 AC 33 ms
19,456 KB
testcase_35 AC 27 ms
19,072 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.Linq;
using System.Text;

namespace ProgrammingContest
{
    class Writer : IDisposable
    {
        private System.IO.TextWriter writer;
        private StringBuilder sb;
        private bool isReactive;
        public Writer(string path) 
            : this(new System.IO.StreamWriter(path))
        {
        }
        public Writer(bool isReactive) 
            : this(null, isReactive)
        {
        }
        public Writer(System.IO.TextWriter writer = null,
                        bool isReactive = false)
        {
            this.writer = (writer ?? Console.Out);
            this.isReactive = isReactive;
            if (!this.isReactive)
            {
                this.sb = new StringBuilder();
            }
        }
        public void Dispose()
        {
            if (!this.isReactive)
            {
                this.writer.Write(sb.ToString());
            }
            if (!this.writer.Equals(Console.Out))
            {
                this.writer.Dispose();
            }
        }
        public void Write(object val)
        {
            if (this.isReactive)
            {
                this.writer.Write(val.ToString());
                this.writer.Flush();
            }
            else
            {
                this.sb.Append(val.ToString());
            }
        }
        public void Write(string format, params object[] vals)
        {
            if (this.isReactive)
            {
                this.writer.Write(format, vals);
                this.writer.Flush();
            }
            else
            {
                this.sb.AppendFormat(format, vals);
            }
        }
        public void WriteLine(object val = null)
        {
            this.Write((val ?? string.Empty).ToString() + System.Environment.NewLine);
        }
        public void WriteLine(int val)
        {
            this.WriteLine(val.ToString());
        }
        public void WriteLine(long val)
        {
            this.WriteLine(val.ToString());
        }
        public void WriteLine(string val)
        {
            this.WriteLine((object)val);
        }
        public void WriteLine(string format, params object[] vals)
        {
            this.Write(format + System.Environment.NewLine, vals);
        }
    }

    class Scanner : IDisposable
    {
        private Queue<string> buffer;
        private char[] sep;
        private System.IO.TextReader reader;
        public Scanner(string path, char[] sep = null) 
            : this(new System.IO.StreamReader(path), sep)
        {
        }
        public Scanner(System.IO.TextReader reader = null,
                        char[] sep = null)
        {
            this.buffer = new Queue<string>();
            this.sep = (sep ?? new char[] { ' ' });
            this.reader = (reader ?? Console.In);
        }
        private void CheckBuffer()
        {
            if (this.buffer.Count == 0 && this.reader.Peek() != -1)
            {
                string str = string.Empty;
                for (; string.IsNullOrEmpty(str);
                    str = this.reader.ReadLine()) ;

                str.Split(this.sep).ToList()
                   .ForEach(el => this.buffer.Enqueue(el));
            }
        }

        public void Dispose()
        {
            if (!this.reader.Equals(Console.In))
            {
                this.reader.Dispose();
            }
        }

        public string Next
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Dequeue();
            }
        }
        public string[] GetStringArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.Next)
                             .ToArray();
        }

        public int NextInt
        {
            get
            {
                return int.Parse(this.Next);
            }
        }
        public int[] GetIntArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextInt)
                             .ToArray();
        }

        public double NextDouble
        {
            get
            {
                return double.Parse(this.Next);
            }
        }
        public double[] GetdoubleArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextDouble)
                             .ToArray();
        }

        public long NextLong
        {
            get
            {
                return long.Parse(this.Next);
            }
        }
        public long[] GetLongArray(int N)
        {
            return Enumerable.Range(0, N)
                             .Select(e => this.NextLong)
                             .ToArray();
        }

        public bool IsEnd
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Count == 0;
            }
        }
    }

    class MainClass : IDisposable
    {
        Scanner sc;
        Writer wr;
        string backPath = "..";
        char dirSep = System.IO.Path.DirectorySeparatorChar;
        string inFilePath = string.Empty;
        string outFilePath = string.Empty;
        public MainClass()
        {
            this.inFilePath = this.backPath
                            + this.dirSep
                            + this.backPath
                            + this.dirSep
                            + "in.txt";
            this.outFilePath = this.backPath
                             + this.dirSep
                             + this.backPath
                             + this.dirSep
                             + "out.txt";

            this.wr = new Writer(this.IsReactive);
            //this.wr = new Writer(this.outFilePath);
#if DEBUG
            if (!this.IsReactive)
            {
                this.sc = new Scanner(this.inFilePath);
            }
            else
            {
                this.sc = new Scanner();
            }
#else
            this.sc = new Scanner();
#endif
        }
        static void Main(string[] args)
        {
            using (var mainClass = new MainClass())
            {
                mainClass.Solve();
            }
        }

        public void Dispose()
        {
            if (this.sc != null)
            {
                this.sc.Dispose();
                this.sc = null;
            }
            if (this.wr != null)
            {
                this.wr.Dispose();
                this.wr = null;
            }
        }

        void MakeTestCase()
        {
            Random rand = new Random();
            if (this.wr != null)
            {
                this.wr.Dispose();
            }
            this.wr = new Writer(inFilePath);


        }

        void Solve()
        {
            var Q = sc.NextInt;
            var K = sc.NextInt;
            var qr = new long[Q];
            for (int i = 0; i < Q; i++)
            {
                if (sc.NextInt == 1)
                {
                    qr[i] = sc.NextLong;
                }
                else
                {
                    qr[i] = -1;
                }
            }
            var vals = qr.Where(e => e > -1).ToArray();
            Array.Sort(vals);
            var dic = new Dictionary<int, long>();
            var revDic = new Dictionary<long, int>();
            {
                int cnt = 0;
                foreach (var e in vals)
                {
                    if (!revDic.ContainsKey(e))
                    {
                        dic.Add(cnt++, e);
                        revDic.Add(e, cnt - 1);
                    }
                }
            }
            var ft = new FenwickTree(dic.Count + 10);

            foreach (var e in qr)
            {
                if (e == -1)
                {
                    if (ft.Get(dic.Count + 1) < K)
                    {
                        wr.WriteLine(-1);
                    }
                    else
                    {
                        int high = dic.Count + 1, low = 0;
                        while (high - low > 1)
                        {
                            int mid = (high + low) / 2;
                            long val = ft.Get(mid);
                            if (val < K)
                            {
                                low = mid;
                            }
                            else
                            {
                                high = mid;
                            }
                        }
                        wr.WriteLine(dic[low]);
                        ft.Add(low, -1);
                    }
                }
                else
                {
                    ft.Add(revDic[e], 1);
                }
            }
        }

        private bool IsReactive { get; } = false; // TODO: reactive check !!
    }

    class FenwickTree
    {
        private long[] bit;
        public FenwickTree(int n)
        {
            this.bit = new long[n];
        }

        public void Add(int idx, long val)
        {
            for (int i = idx; i < this.bit.Length; i |= i + 1)
            {
                this.bit[i] += val;
            }
        }

        // [0, n)
        public long Get(int r)
        {
            long ret = 0;
            for (int i = r - 1; i >= 0; i = (i & (i + 1)) - 1)
            {
                ret += this.bit[i];
            }
            return ret;
        }
        // [l, r)
        public long Get(int l, int r)
        {
            return this.Get(r) - this.Get(l - 1);
        }
    }
}
0