結果
| 問題 |
No.1012 荷物収集
|
| コンテスト | |
| ユーザー |
 Oland
|
| 提出日時 | 2020-03-20 23:45:55 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,643 bytes |
| コンパイル時間 | 4,638 ms |
| コンパイル使用メモリ | 84,084 KB |
| 実行使用メモリ | 69,040 KB |
| 最終ジャッジ日時 | 2024-12-15 21:10:11 |
| 合計ジャッジ時間 | 21,737 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 11 WA * 30 |
ソースコード
import javax.transaction.xa.Xid;
import java.io.*;
import java.math.BigDecimal;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
final static int MOD = (int)1e9+7;
final static long INF = Long.MAX_VALUE / 2;
void solve(){
int N = in.nextInt(), Q = in.nextInt();
long sumRight = 0, sumLeft = 0;
long[] ans = new long[Q+1];
long[][] xw = new long[N][2];
for(int i = 0; i < N; i++){
xw[i] = in.nextLongArray(2);
sumRight += xw[i][1];
ans[0] += xw[i][0] * xw[i][1];
}
Arrays.sort(xw, (e1, e2)->Long.compare(e1[0], e2[0]));
long[][] Xidx = new long[Q+1][2];
for(int i = 1; i <= Q; i++){
Xidx[i][0] = in.nextLong();
Xidx[i][1] = i;
}
Arrays.sort(Xidx, (e1, e2)->Long.compare(e1[0], e2[0]));
int idx = 0;
for(int i = 1; i <= Q; i++){
long sumTmp = 0, cost = ans[(int)Xidx[i][1] - 1];
while(idx < N && xw[idx][0] < Xidx[i][0]){
sumRight -= xw[idx][1];
sumTmp += xw[idx][1];
cost -= (xw[idx][0] - Xidx[i - 1][0]) * xw[idx][1];
cost += (Xidx[i][0] - xw[idx][0]) * xw[idx][1];
idx++;
}
long d = Xidx[i][0] - Xidx[i-1][0];
cost += d * sumLeft;
cost -= d * sumRight;
ans[(int)Xidx[i][1]] = cost;
sumLeft += sumTmp;
}
for(int i = 1; i <= Q; i++){
out.println(ans[i]);
}
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}