結果
問題 | No.1012 荷物収集 |
ユーザー | hiromi_ayase |
提出日時 | 2020-03-21 10:06:06 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 833 ms / 2,000 ms |
コード長 | 3,745 bytes |
コンパイル時間 | 2,662 ms |
コンパイル使用メモリ | 88,440 KB |
実行使用メモリ | 79,784 KB |
最終ジャッジ日時 | 2024-05-10 03:17:37 |
合計ジャッジ時間 | 24,471 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 81 ms
51,380 KB |
testcase_01 | AC | 82 ms
51,168 KB |
testcase_02 | AC | 83 ms
51,184 KB |
testcase_03 | AC | 83 ms
51,280 KB |
testcase_04 | AC | 604 ms
77,820 KB |
testcase_05 | AC | 614 ms
75,904 KB |
testcase_06 | AC | 591 ms
76,052 KB |
testcase_07 | AC | 574 ms
74,084 KB |
testcase_08 | AC | 594 ms
73,812 KB |
testcase_09 | AC | 574 ms
73,748 KB |
testcase_10 | AC | 589 ms
74,024 KB |
testcase_11 | AC | 579 ms
74,028 KB |
testcase_12 | AC | 579 ms
75,744 KB |
testcase_13 | AC | 583 ms
73,976 KB |
testcase_14 | AC | 103 ms
52,188 KB |
testcase_15 | AC | 112 ms
52,372 KB |
testcase_16 | AC | 106 ms
51,964 KB |
testcase_17 | AC | 109 ms
51,924 KB |
testcase_18 | AC | 107 ms
52,068 KB |
testcase_19 | AC | 103 ms
52,192 KB |
testcase_20 | AC | 102 ms
52,048 KB |
testcase_21 | AC | 109 ms
51,828 KB |
testcase_22 | AC | 107 ms
51,844 KB |
testcase_23 | AC | 106 ms
51,844 KB |
testcase_24 | AC | 582 ms
65,420 KB |
testcase_25 | AC | 734 ms
70,772 KB |
testcase_26 | AC | 531 ms
65,680 KB |
testcase_27 | AC | 274 ms
57,472 KB |
testcase_28 | AC | 746 ms
73,388 KB |
testcase_29 | AC | 502 ms
67,848 KB |
testcase_30 | AC | 772 ms
74,964 KB |
testcase_31 | AC | 368 ms
59,204 KB |
testcase_32 | AC | 391 ms
61,584 KB |
testcase_33 | AC | 467 ms
61,532 KB |
testcase_34 | AC | 483 ms
61,692 KB |
testcase_35 | AC | 662 ms
68,240 KB |
testcase_36 | AC | 399 ms
61,180 KB |
testcase_37 | AC | 506 ms
66,084 KB |
testcase_38 | AC | 626 ms
65,756 KB |
testcase_39 | AC | 375 ms
61,608 KB |
testcase_40 | AC | 418 ms
61,600 KB |
testcase_41 | AC | 833 ms
79,784 KB |
testcase_42 | AC | 473 ms
63,772 KB |
testcase_43 | AC | 602 ms
65,616 KB |
testcase_44 | AC | 82 ms
51,392 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int q = ni(); long[][] p = new long[n][2]; for (int i = 0; i < n; i++) { p[i][0] = nl(); // x p[i][1] = nl(); // w } Arrays.sort(p, (o1, o2) -> Long.signum(o1[0] - o2[0])); // p [0:x, w, total w l, total sum l, total w r, total sum r] long[][] ql = new long[n][2]; long[][] qr = new long[n][2]; ql[0][1] = p[0][1]; for (int i = 1; i < n; i++) { ql[i][0] = ql[i - 1][0] + ql[i - 1][1] * (p[i][0] - p[i - 1][0]); ql[i][1] = ql[i - 1][1] + p[i][1]; } qr[n - 1][1] = p[n - 1][1]; for (int i = n - 2; i >= 0; i--) { qr[i][0] = qr[i + 1][0] + qr[i + 1][1] * (p[i + 1][0] - p[i][0]); qr[i][1] = qr[i + 1][1] + p[i][1]; } for (int i = 0; i < q; i++) { long x = nl(); int idx = lowerBound(p, x); long ret = 0; if (idx > 0) { ret += (x - p[idx - 1][0]) * ql[idx - 1][1] + ql[idx - 1][0]; } if (idx <= n - 1) { ret += (p[idx][0] - x) * qr[idx][1] + qr[idx][0]; } out.println(ret); } } public static int lowerBound(long[][] a, long v) { int low = -1, high = a.length; while (high - low > 1) { int h = high + low >>> 1; if (a[h][0] >= v) { high = h; } else { low = h; } } return high; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }