結果
| 問題 |
No.1012 荷物収集
|
| コンテスト | |
| ユーザー |
tenten
|
| 提出日時 | 2021-08-06 15:06:04 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 2,132 bytes |
| コンパイル時間 | 1,830 ms |
| コンパイル使用メモリ | 78,764 KB |
| 実行使用メモリ | 69,176 KB |
| 最終ジャッジ日時 | 2024-09-17 00:28:49 |
| 合計ジャッジ時間 | 17,465 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 11 WA * 30 |
ソースコード
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int q = sc.nextInt();
Pack[] packs = new Pack[n];
long ans = 0;
int right = 0;
for (int i = 0; i < n; i++) {
packs[i] = new Pack(sc.nextInt(), sc.nextInt());
ans += (long)packs[i].weight * packs[i].position;
right += packs[i].weight;
}
Arrays.sort(packs);
int left = 0;
int prev = 0;
int idx = 0;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < q; i++) {
int x = sc.nextInt();
ans += (long)left * (x - prev);
while (idx < n && packs[idx].position <= x) {
ans += ((long)x + prev - packs[idx].position * 2) * packs[idx].weight;
left += packs[idx].weight;
right -= packs[idx].weight;
idx++;
}
ans -= (long)right * (x - prev);
sb.append(ans).append("\n");
prev = x;
}
System.out.print(sb);
}
static class Pack implements Comparable<Pack> {
int position;
int weight;
public Pack(int position, int weight) {
this.position = position;
this.weight = weight;
}
public int compareTo(Pack another) {
return position - another.position;
}
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public String next() throws Exception {
if (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
tenten