結果

問題 No.649 ここでちょっとQK！
ユーザー yuya178yuya178
提出日時 2018-02-09 23:04:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,298 ms / 3,000 ms
コード長 5,656 bytes
コンパイル時間 2,734 ms
コンパイル使用メモリ 82,324 KB
実行使用メモリ 119,048 KB
最終ジャッジ日時 2024-04-17 05:59:45
合計ジャッジ時間 23,885 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 118 ms
53,656 KB
testcase_01 AC 118 ms
53,924 KB
testcase_02 AC 117 ms
53,912 KB
testcase_03 AC 598 ms
71,840 KB
testcase_04 AC 597 ms
110,612 KB
testcase_05 AC 603 ms
110,752 KB
testcase_06 AC 336 ms
73,280 KB
testcase_07 AC 119 ms
53,508 KB
testcase_08 AC 120 ms
53,652 KB
testcase_09 AC 117 ms
53,696 KB
testcase_10 AC 115 ms
53,916 KB
testcase_11 AC 116 ms
53,564 KB
testcase_12 AC 715 ms
99,024 KB
testcase_13 AC 674 ms
87,888 KB
testcase_14 AC 687 ms
96,344 KB
testcase_15 AC 693 ms
95,564 KB
testcase_16 AC 695 ms
89,984 KB
testcase_17 AC 762 ms
93,916 KB
testcase_18 AC 818 ms
94,324 KB
testcase_19 AC 866 ms
99,740 KB
testcase_20 AC 901 ms
97,024 KB
testcase_21 AC 1,062 ms
112,972 KB
testcase_22 AC 1,103 ms
113,304 KB
testcase_23 AC 1,143 ms
114,048 KB
testcase_24 AC 1,179 ms
112,160 KB
testcase_25 AC 1,255 ms
119,048 KB
testcase_26 AC 1,298 ms
112,508 KB
testcase_27 AC 137 ms
54,216 KB
testcase_28 AC 137 ms
54,104 KB
testcase_29 AC 136 ms
54,144 KB
testcase_30 AC 610 ms
82,804 KB
testcase_31 AC 554 ms
81,488 KB
testcase_32 AC 115 ms
53,672 KB
testcase_33 AC 114 ms
53,924 KB
testcase_34 AC 115 ms
53,900 KB
testcase_35 AC 112 ms
53,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long mod = 1_000_000_007;
    int inf = Integer.MAX_VALUE;

    void solve(){
        int q = ni();
        int k = ni();
        long[][] res = new long[q][2];
        TreeSet<Long> set = new TreeSet<>();
        for(int i = 0; i < q; i++){
            res[i][0] = nl();
            if(res[i][0]==1){
                res[i][1] = nl();
                set.add(res[i][1]);
            }
            else res[i][1] = -1;
        }
        HashMap<Long, Integer> map = new HashMap<>();
        HashMap<Integer, Long> rmap = new HashMap<>();
        for(long i : set){
            if(!map.containsKey(i)){
                map.put(i, map.size());
                rmap.put(map.get(i), i);
            }
        }
        int n = map.size();
        SegmentTree seg = new SegmentTree();
        for(int i = 0; i < q; i++){
            if(res[i][0]==1){
                int tmp = map.get(res[i][1]);
                seg.update(tmp, 1);
            }
            else{
                int left = 0;
                int right = n+1000;
                while(right-left>1){
                    int mid = (left+right)/2;
                    long num = seg.query(0,mid);
                    if(num<k) left = mid;
                    else right = mid;
                }
                if(left>n) out.println(-1);
                else{
                    out.println(rmap.get(left));
                    seg.update(left,-1);
                }
            }
        }   

    }

    class SegmentTree {
        int SIZE = 1 << 18;
        long[][] seg;
        SegmentTree() {
            this.seg = new long[2 * SIZE][1];
            for(int i=0;i<2*SIZE;++i){
                seg[i][0] = 0;
            }
        }
        long comb(long ans1, long ans2){
            return ans1+ans2;
        }
        void update(int x, long value) {
            x += SIZE - 1;
            this.seg[x][0] += value;
            while (x > 0) {
                x = (x - 1) / 2;
                this.seg[x][0] = comb(this.seg[2 * x + 1][0], this.seg[2 * x + 2][0]);
            }
        }
        long query(int a,int b,int l,int r,int k){
            if(a<=l&&r<=b) return seg[k][0];
            if(b<=l||r<=a) return 0;
            long ans1=query(a,b,l,(l+r)/2,2*k+1);
            long ans2=query(a,b,(l+r)/2,r,2*k+2);
            return comb(ans1, ans2);
        }
        long query(int l, int r) {
            return query(l,r,0,SIZE,0);
        }
    }

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0