結果
問題 | No.649 ここでちょっとQK! |
ユーザー | Grenache |
提出日時 | 2018-02-09 23:06:21 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,076 ms / 3,000 ms |
コード長 | 5,099 bytes |
コンパイル時間 | 4,118 ms |
コンパイル使用メモリ | 77,348 KB |
実行使用メモリ | 84,760 KB |
最終ジャッジ日時 | 2023-07-30 04:03:39 |
合計ジャッジ時間 | 21,599 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
49,836 KB |
testcase_01 | AC | 45 ms
49,656 KB |
testcase_02 | AC | 45 ms
49,436 KB |
testcase_03 | AC | 267 ms
61,492 KB |
testcase_04 | AC | 570 ms
78,540 KB |
testcase_05 | AC | 537 ms
78,792 KB |
testcase_06 | AC | 327 ms
59,280 KB |
testcase_07 | AC | 46 ms
49,564 KB |
testcase_08 | AC | 46 ms
49,528 KB |
testcase_09 | AC | 45 ms
49,484 KB |
testcase_10 | AC | 46 ms
49,484 KB |
testcase_11 | AC | 45 ms
49,600 KB |
testcase_12 | AC | 610 ms
66,976 KB |
testcase_13 | AC | 607 ms
66,584 KB |
testcase_14 | AC | 591 ms
63,940 KB |
testcase_15 | AC | 618 ms
66,116 KB |
testcase_16 | AC | 584 ms
64,460 KB |
testcase_17 | AC | 743 ms
68,172 KB |
testcase_18 | AC | 778 ms
68,668 KB |
testcase_19 | AC | 770 ms
69,488 KB |
testcase_20 | AC | 804 ms
73,868 KB |
testcase_21 | AC | 878 ms
74,312 KB |
testcase_22 | AC | 885 ms
75,832 KB |
testcase_23 | AC | 1,028 ms
79,624 KB |
testcase_24 | AC | 979 ms
82,260 KB |
testcase_25 | AC | 990 ms
80,364 KB |
testcase_26 | AC | 1,076 ms
84,760 KB |
testcase_27 | AC | 64 ms
50,468 KB |
testcase_28 | AC | 77 ms
50,688 KB |
testcase_29 | AC | 63 ms
50,504 KB |
testcase_30 | AC | 366 ms
60,640 KB |
testcase_31 | AC | 390 ms
61,420 KB |
testcase_32 | AC | 45 ms
49,540 KB |
testcase_33 | AC | 45 ms
49,608 KB |
testcase_34 | AC | 46 ms
49,400 KB |
testcase_35 | AC | 45 ms
49,636 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder649 { private static Scanner sc; private static Printer pr; private static void solve() { int q = sc.nextInt(); int k = sc.nextInt(); int[] qt = new int[q]; long[] qv = new long[q]; Set<Long> hs = new HashSet<>(); for (int i = 0; i < q; i++) { qt[i] = sc.nextInt(); if (qt[i] == 1) { qv[i] = sc.nextLong(); hs.add(qv[i]); } } List<Long> list = new ArrayList<>(hs); Collections.sort(list); int n = list.size(); BIT bit = new BIT(n); for (int i = 0; i < q; i++) { if (qt[i] == 1) { int index = Collections.binarySearch(list, qv[i]) + 1; bit.update(index, 1); } else { int l = 0; int r = n + 1; while (r - l > 1) { int mid = l + (r - l) / 2; if (bit.sum(mid) >= k) { r = mid; } else { l = mid; } } if (r == n + 1) { pr.println(-1); } else { pr.println(list.get(r - 1)); bit.update(r, -1); } } } } private static class BIT { // [0,n-1] int[] bit; int n; // [1,n] BIT(int n) { this.n = n; bit = new int[this.n]; } // i:1-indexed void update(int i, int x) { while (i <= n) { bit[i - 1] += x; i += i & (-i); } } // i:1-indexed int sum(int i) { int sum = 0; while (i > 0) { sum += bit[i - 1]; i -= i & (-i); } return sum; } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }