結果
問題 | No.649 ここでちょっとQK! |
ユーザー | Oland |
提出日時 | 2019-05-02 23:46:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,081 ms / 3,000 ms |
コード長 | 5,433 bytes |
コンパイル時間 | 3,213 ms |
コンパイル使用メモリ | 80,268 KB |
実行使用メモリ | 100,324 KB |
最終ジャッジ日時 | 2023-08-30 04:59:29 |
合計ジャッジ時間 | 24,135 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
51,208 KB |
testcase_01 | AC | 63 ms
51,184 KB |
testcase_02 | AC | 63 ms
51,328 KB |
testcase_03 | AC | 988 ms
76,664 KB |
testcase_04 | AC | 450 ms
87,596 KB |
testcase_05 | AC | 420 ms
88,268 KB |
testcase_06 | AC | 368 ms
84,292 KB |
testcase_07 | AC | 61 ms
51,276 KB |
testcase_08 | AC | 63 ms
53,176 KB |
testcase_09 | AC | 62 ms
51,184 KB |
testcase_10 | AC | 63 ms
51,532 KB |
testcase_11 | AC | 62 ms
51,472 KB |
testcase_12 | AC | 604 ms
76,752 KB |
testcase_13 | AC | 604 ms
79,116 KB |
testcase_14 | AC | 631 ms
76,996 KB |
testcase_15 | AC | 630 ms
78,980 KB |
testcase_16 | AC | 608 ms
75,660 KB |
testcase_17 | AC | 746 ms
82,808 KB |
testcase_18 | AC | 754 ms
83,952 KB |
testcase_19 | AC | 843 ms
86,108 KB |
testcase_20 | AC | 914 ms
85,604 KB |
testcase_21 | AC | 917 ms
88,232 KB |
testcase_22 | AC | 908 ms
85,220 KB |
testcase_23 | AC | 920 ms
88,484 KB |
testcase_24 | AC | 984 ms
89,292 KB |
testcase_25 | AC | 1,015 ms
90,244 KB |
testcase_26 | AC | 1,081 ms
100,324 KB |
testcase_27 | AC | 83 ms
50,260 KB |
testcase_28 | AC | 82 ms
51,508 KB |
testcase_29 | AC | 80 ms
52,400 KB |
testcase_30 | AC | 561 ms
76,168 KB |
testcase_31 | AC | 567 ms
76,272 KB |
testcase_32 | AC | 62 ms
51,176 KB |
testcase_33 | AC | 62 ms
51,344 KB |
testcase_34 | AC | 62 ms
51,272 KB |
testcase_35 | AC | 61 ms
51,312 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.Map.Entry; import java.util.stream.Collectors; @SuppressWarnings("unused") public class Main { //final boolean isDebug = true; final boolean isDebug = false; String fileName = "input.txt"; FastScanner sc; PrintWriter out; final int MOD = (int)1e9+7; final int INF = Integer.MAX_VALUE / 2; void solve() throws Exception{ int Q = sc.nextInt(); int K = sc.nextInt(); ArrayList<List<Long>> query = new ArrayList<>(); ArrayList<Long> list = new ArrayList<>(); for(int i = 0; i < Q; i++){ long q = sc.nextLong(); if(q == 1){ long v = sc.nextLong(); query.add(Arrays.asList(q, v)); list.add(v); }else{ query.add(Arrays.asList(q)); } } ArrayList<Long> uniqueList = new ArrayList<>(list.stream().sorted().distinct().collect(Collectors.toList())); int MAX = 2*(int)1e5; BinaryIndexedTree bit = new BinaryIndexedTree(MAX); for(List<Long> e : query){ if(e.get(0) == 1){ long v = e.get(1); int index = Collections.binarySearch(uniqueList, v); bit.add(index+1, 1); }else{ int n = bit.getKth(K); if(n == -1){ System.out.println("-1"); }else{ int index = n-1; long v = uniqueList.get(index); System.out.println(v); bit.add(n, -1); } } } } /* end solve */ /* main */ public static void main(String[] args) throws Exception { new Main().m(); } void m() throws Exception { long S = System.currentTimeMillis(); sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); if(isDebug){ System.out.println("---Debug---"); System.out.printf("%8d ms", (G-S)); } } /* end main */ } /* end Main */ class BinaryIndexedTree{ int n; int[] node; /* 初期値は0 */ public BinaryIndexedTree(int n){ this.n = n; node = new int[n+1]; } /* 1-indexed */ public void add(int x, int val){ for(int i = x; i <= n; i += (i & -i)){ node[i] += val; } } /* * [1,a], 1-indexed * sum(0) == 0 */ public int getSum(int a){ int res = 0; for(int i = a; i > 0; i -= (i & -i)){ res += node[i]; } return res; } /* [a,b], 1-indexed */ public int getSum(int a, int b){ return getSum(b) - getSum(a-1); } /* //[a,b), 1-indexed public int sum(int a, int b){ return sum(b-1) - sum(a-1); } */ /* * 小さいほうからk番目の値を二分探索で求める * (v1 + ~ + vx) >= k となるような最小のxを求める * 格納されている数がk個未満なら-1を返す * 1-indexed */ public int getKth(int k){ if(k <= 0) return 0; int res = 0; int N = 1; while(N < node.length) N *= 2; for(int i = N / 2; i > 0; i /= 2){ if(res + i < node.length && node[res + i] < k){ k -= node[res + i]; res += i; } } if(res+1 > n) return -1; return res+1; } } class FastScanner { private InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c){ return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public String nextLine() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(b != 10) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }