結果
問題 | No.1012 荷物収集 |
ユーザー | uwi |
提出日時 | 2020-03-20 21:31:17 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 489 ms / 2,000 ms |
コード長 | 3,940 bytes |
コンパイル時間 | 4,080 ms |
コンパイル使用メモリ | 82,384 KB |
実行使用メモリ | 67,556 KB |
最終ジャッジ日時 | 2023-08-21 15:23:57 |
合計ジャッジ時間 | 21,531 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,484 KB |
testcase_01 | AC | 44 ms
49,496 KB |
testcase_02 | AC | 43 ms
49,348 KB |
testcase_03 | AC | 44 ms
49,628 KB |
testcase_04 | AC | 272 ms
64,684 KB |
testcase_05 | AC | 309 ms
67,556 KB |
testcase_06 | AC | 289 ms
63,968 KB |
testcase_07 | AC | 285 ms
64,308 KB |
testcase_08 | AC | 271 ms
63,600 KB |
testcase_09 | AC | 314 ms
66,540 KB |
testcase_10 | AC | 279 ms
64,724 KB |
testcase_11 | AC | 288 ms
63,880 KB |
testcase_12 | AC | 315 ms
67,368 KB |
testcase_13 | AC | 300 ms
63,920 KB |
testcase_14 | AC | 48 ms
49,744 KB |
testcase_15 | AC | 59 ms
50,196 KB |
testcase_16 | AC | 50 ms
49,496 KB |
testcase_17 | AC | 58 ms
49,644 KB |
testcase_18 | AC | 57 ms
50,616 KB |
testcase_19 | AC | 48 ms
49,472 KB |
testcase_20 | AC | 49 ms
49,580 KB |
testcase_21 | AC | 49 ms
49,588 KB |
testcase_22 | AC | 56 ms
50,212 KB |
testcase_23 | AC | 50 ms
49,484 KB |
testcase_24 | AC | 393 ms
61,532 KB |
testcase_25 | AC | 455 ms
63,136 KB |
testcase_26 | AC | 261 ms
57,584 KB |
testcase_27 | AC | 137 ms
54,044 KB |
testcase_28 | AC | 437 ms
64,016 KB |
testcase_29 | AC | 222 ms
57,508 KB |
testcase_30 | AC | 439 ms
63,772 KB |
testcase_31 | AC | 277 ms
57,140 KB |
testcase_32 | AC | 251 ms
57,864 KB |
testcase_33 | AC | 344 ms
59,184 KB |
testcase_34 | AC | 375 ms
59,440 KB |
testcase_35 | AC | 385 ms
62,344 KB |
testcase_36 | AC | 336 ms
61,344 KB |
testcase_37 | AC | 231 ms
56,832 KB |
testcase_38 | AC | 400 ms
61,624 KB |
testcase_39 | AC | 226 ms
58,468 KB |
testcase_40 | AC | 261 ms
57,540 KB |
testcase_41 | AC | 489 ms
63,852 KB |
testcase_42 | AC | 295 ms
57,936 KB |
testcase_43 | AC | 358 ms
61,432 KB |
testcase_44 | AC | 43 ms
49,344 KB |
ソースコード
package contest200320; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), Q = ni(); int[][] xw = new int[n][]; for(int i = 0;i < n;i++){ xw[i] = na(2); } Arrays.sort(xw, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); int[][] qs = new int[Q][]; for(int i= 0;i < Q;i++){ qs[i] = new int[]{ni(), i}; } Arrays.sort(qs, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); long lws = 0, lwxs = 0; long rws = 0, rwxs = 0; for(int[] u : xw){ rws += u[1]; rwxs += (long)u[0]*u[1]; } long[] anss = new long[Q]; int p = 0; for(int[] q : qs){ while(p < n && xw[p][0] < q[0]){ long lx = xw[p][0]; long lw = xw[p][1]; rws -= lw; lws += lw; rwxs -= lw*lx; lwxs += lw*lx; p++; } anss[q[1]] = (lws * q[0] - lwxs) + (rwxs - rws * q[0]); } for(long u : anss){ out.println(u); } } 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 D().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)); } }