結果

問題 No.1012 荷物収集
ユーザー uwiuwi
提出日時 2020-03-20 21:31:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 536 ms / 2,000 ms
コード長 3,940 bytes
コンパイル時間 5,048 ms
コンパイル使用メモリ 81,428 KB
実行使用メモリ 67,636 KB
最終ジャッジ日時 2024-12-15 04:15:49
合計ジャッジ時間 20,856 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,188 KB
testcase_01 AC 56 ms
50,284 KB
testcase_02 AC 55 ms
50,116 KB
testcase_03 AC 55 ms
50,404 KB
testcase_04 AC 336 ms
67,580 KB
testcase_05 AC 334 ms
67,484 KB
testcase_06 AC 334 ms
67,612 KB
testcase_07 AC 336 ms
67,428 KB
testcase_08 AC 335 ms
67,636 KB
testcase_09 AC 341 ms
67,596 KB
testcase_10 AC 302 ms
65,900 KB
testcase_11 AC 272 ms
63,704 KB
testcase_12 AC 272 ms
63,828 KB
testcase_13 AC 295 ms
65,608 KB
testcase_14 AC 57 ms
50,144 KB
testcase_15 AC 76 ms
50,096 KB
testcase_16 AC 59 ms
50,028 KB
testcase_17 AC 66 ms
50,448 KB
testcase_18 AC 64 ms
50,528 KB
testcase_19 AC 58 ms
50,100 KB
testcase_20 AC 57 ms
50,368 KB
testcase_21 AC 58 ms
50,212 KB
testcase_22 AC 62 ms
50,500 KB
testcase_23 AC 60 ms
50,004 KB
testcase_24 AC 399 ms
60,804 KB
testcase_25 AC 536 ms
63,884 KB
testcase_26 AC 276 ms
57,928 KB
testcase_27 AC 150 ms
53,172 KB
testcase_28 AC 436 ms
63,612 KB
testcase_29 AC 248 ms
56,408 KB
testcase_30 AC 464 ms
63,948 KB
testcase_31 AC 306 ms
57,320 KB
testcase_32 AC 256 ms
57,984 KB
testcase_33 AC 357 ms
58,700 KB
testcase_34 AC 346 ms
60,384 KB
testcase_35 AC 396 ms
59,996 KB
testcase_36 AC 349 ms
57,620 KB
testcase_37 AC 247 ms
56,956 KB
testcase_38 AC 412 ms
60,720 KB
testcase_39 AC 239 ms
57,464 KB
testcase_40 AC 269 ms
58,064 KB
testcase_41 AC 510 ms
63,080 KB
testcase_42 AC 320 ms
58,056 KB
testcase_43 AC 362 ms
61,440 KB
testcase_44 AC 56 ms
50,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
}
0