結果
問題 | No.989 N×Mマス計算(K以上) |
ユーザー | uwi |
提出日時 | 2020-02-14 21:27:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 163 ms / 2,000 ms |
コード長 | 3,741 bytes |
コンパイル時間 | 3,843 ms |
コンパイル使用メモリ | 83,984 KB |
実行使用メモリ | 53,768 KB |
最終ジャッジ日時 | 2024-10-06 10:36:05 |
合計ジャッジ時間 | 6,499 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
50,504 KB |
testcase_01 | AC | 50 ms
49,968 KB |
testcase_02 | AC | 53 ms
50,348 KB |
testcase_03 | AC | 54 ms
50,244 KB |
testcase_04 | AC | 50 ms
50,292 KB |
testcase_05 | AC | 53 ms
50,248 KB |
testcase_06 | AC | 51 ms
50,064 KB |
testcase_07 | AC | 52 ms
50,424 KB |
testcase_08 | AC | 52 ms
50,352 KB |
testcase_09 | AC | 51 ms
50,256 KB |
testcase_10 | AC | 135 ms
53,252 KB |
testcase_11 | AC | 136 ms
53,536 KB |
testcase_12 | AC | 143 ms
52,324 KB |
testcase_13 | AC | 113 ms
52,704 KB |
testcase_14 | AC | 163 ms
53,768 KB |
testcase_15 | AC | 99 ms
52,580 KB |
testcase_16 | AC | 124 ms
53,196 KB |
testcase_17 | AC | 111 ms
52,424 KB |
testcase_18 | AC | 99 ms
52,032 KB |
testcase_19 | AC | 148 ms
53,240 KB |
ソースコード
package contest200214; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(), K = ni(); char o = nc(); int[] b = na(m); int[] a = na(n); Arrays.sort(b); if(o == '+') { long ans = 0; for(int v : a) { ans += m - lowerBound(b, K-v); } out.println(ans); }else { long ans = 0; for(int v : a) { ans += m - lowerBound(b, (K+v-1)/v); } out.println(ans); } } public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); } public static int lowerBound(int[] a, int l, int r, int v) { if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException(); int low = l-1, high = r; while(high-low > 1){ int h = high+low>>>1; if(a[h] >= v){ high = h; }else{ low = h; } } return high; } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public 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))){ // when nextLine, (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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }