結果
問題 | No.3016 unordered_mapなるたけ落とすマン |
ユーザー | yuppe19 😺 |
提出日時 | 2016-05-28 20:00:48 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,690 bytes |
コンパイル時間 | 3,248 ms |
コンパイル使用メモリ | 78,760 KB |
実行使用メモリ | 48,384 KB |
最終ジャッジ日時 | 2024-04-16 18:11:24 |
合計ジャッジ時間 | 22,077 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,760 KB |
testcase_01 | AC | 52 ms
36,792 KB |
testcase_02 | AC | 52 ms
36,864 KB |
testcase_03 | AC | 271 ms
46,956 KB |
testcase_04 | AC | 372 ms
47,680 KB |
testcase_05 | AC | 380 ms
47,732 KB |
testcase_06 | AC | 355 ms
47,728 KB |
testcase_07 | AC | 376 ms
47,876 KB |
testcase_08 | AC | 363 ms
47,844 KB |
testcase_09 | AC | 395 ms
47,788 KB |
testcase_10 | AC | 353 ms
47,832 KB |
testcase_11 | AC | 374 ms
47,764 KB |
testcase_12 | AC | 371 ms
47,800 KB |
testcase_13 | AC | 354 ms
47,896 KB |
testcase_14 | AC | 383 ms
47,788 KB |
testcase_15 | AC | 365 ms
47,932 KB |
testcase_16 | AC | 374 ms
47,764 KB |
testcase_17 | AC | 368 ms
47,764 KB |
testcase_18 | AC | 355 ms
47,828 KB |
testcase_19 | MLE | - |
testcase_20 | AC | 362 ms
47,992 KB |
testcase_21 | AC | 345 ms
47,804 KB |
testcase_22 | AC | 361 ms
47,768 KB |
testcase_23 | AC | 371 ms
47,876 KB |
testcase_24 | AC | 353 ms
47,812 KB |
testcase_25 | AC | 344 ms
47,772 KB |
testcase_26 | AC | 362 ms
47,676 KB |
testcase_27 | MLE | - |
testcase_28 | AC | 353 ms
47,836 KB |
testcase_29 | AC | 377 ms
47,896 KB |
testcase_30 | AC | 448 ms
47,768 KB |
testcase_31 | AC | 367 ms
47,696 KB |
testcase_32 | MLE | - |
testcase_33 | AC | 372 ms
47,840 KB |
testcase_34 | AC | 341 ms
47,868 KB |
testcase_35 | AC | 355 ms
47,764 KB |
testcase_36 | MLE | - |
testcase_37 | AC | 344 ms
47,832 KB |
testcase_38 | AC | 364 ms
47,852 KB |
testcase_39 | AC | 347 ms
47,796 KB |
testcase_40 | MLE | - |
testcase_41 | AC | 53 ms
36,616 KB |
testcase_42 | AC | 53 ms
36,888 KB |
testcase_43 | AC | 53 ms
36,556 KB |
testcase_44 | AC | 128 ms
40,092 KB |
testcase_45 | AC | 144 ms
39,884 KB |
testcase_46 | AC | 146 ms
40,052 KB |
testcase_47 | AC | 397 ms
47,364 KB |
testcase_48 | MLE | - |
testcase_49 | AC | 410 ms
47,440 KB |
testcase_50 | AC | 266 ms
46,940 KB |
ソースコード
import java.io.*; import java.util.*; import static java.util.Arrays.*; class FastScanner { // {{{ private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if(ptr < buflen) { return true; } ptr = 0; try { buflen = in.read(buffer); } catch(IOException ex) { ex.printStackTrace(); } if(buflen <= 0) { return false; } return true; } private int readByte() { if(hasNextByte()) { return buffer[ptr++]; } return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) { ptr++; } } public boolean hasNext() { skipUnprintable(); 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 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(); } } } // }}} class LowerBound<T extends Comparable<? super T>> implements Comparator<T> { public int compare(T x, T y) { return x.compareTo(y) >= 0 ? 1 : -1; } } class UpperBound<T extends Comparable<? super T>> implements Comparator<T> { public int compare(T x, T y) { return x.compareTo(y) > 0 ? 1 : -1; } } public class Main { private void solve() { FastScanner sc = new FastScanner(); int n = (int)sc.nextLong(), m = (int)sc.nextLong(); Long[] a = new Long[n]; for(int i=0; i<n; ++i) { a[i] = sc.nextLong(); } sort(a); Comparator<Long> upperBound = new UpperBound<>(), lowerBound = new LowerBound<>(); PrintWriter out = new PrintWriter(System.out); for(int i=0; i<m; ++i) { if(i > 0) { out.print(' '); } long bi = sc.nextLong(); int p = ~binarySearch(a, bi, upperBound) - ~binarySearch(a, bi, lowerBound); out.print(p); } out.println(); out.flush(); } public static void main(String[] args) { new Main().solve(); } }