結果
問題 | No.1012 荷物収集 |
ユーザー | daut-dlang |
提出日時 | 2020-03-20 22:56:15 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 162 ms / 2,000 ms |
コード長 | 2,949 bytes |
コンパイル時間 | 1,190 ms |
コンパイル使用メモリ | 120,344 KB |
実行使用メモリ | 20,264 KB |
最終ジャッジ日時 | 2023-09-04 06:22:17 |
合計ジャッジ時間 | 8,862 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 136 ms
18,852 KB |
testcase_05 | AC | 138 ms
18,996 KB |
testcase_06 | AC | 135 ms
19,300 KB |
testcase_07 | AC | 137 ms
20,180 KB |
testcase_08 | AC | 138 ms
20,204 KB |
testcase_09 | AC | 138 ms
19,400 KB |
testcase_10 | AC | 138 ms
20,264 KB |
testcase_11 | AC | 137 ms
19,392 KB |
testcase_12 | AC | 138 ms
20,188 KB |
testcase_13 | AC | 139 ms
20,224 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 3 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 108 ms
15,044 KB |
testcase_25 | AC | 144 ms
18,788 KB |
testcase_26 | AC | 86 ms
13,892 KB |
testcase_27 | AC | 21 ms
4,904 KB |
testcase_28 | AC | 146 ms
18,244 KB |
testcase_29 | AC | 99 ms
13,748 KB |
testcase_30 | AC | 150 ms
15,356 KB |
testcase_31 | AC | 51 ms
6,984 KB |
testcase_32 | AC | 48 ms
8,028 KB |
testcase_33 | AC | 70 ms
8,484 KB |
testcase_34 | AC | 72 ms
7,680 KB |
testcase_35 | AC | 125 ms
14,768 KB |
testcase_36 | AC | 64 ms
7,396 KB |
testcase_37 | AC | 92 ms
14,284 KB |
testcase_38 | AC | 113 ms
14,736 KB |
testcase_39 | AC | 54 ms
11,324 KB |
testcase_40 | AC | 60 ms
11,140 KB |
testcase_41 | AC | 162 ms
18,500 KB |
testcase_42 | AC | 74 ms
13,296 KB |
testcase_43 | AC | 108 ms
14,992 KB |
testcase_44 | AC | 1 ms
4,380 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(T)(ref T x, T y) { x = (x + y) % mod; } void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; } void modm(T)(ref T x, T y) { x = (x * y) % mod; } void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); } void main() { auto N = RD; auto Q = RD; auto xw = new long[][](N); foreach (i; 0..N) { xw[i] = [RD, RD]; } auto X = RDA; xw.sort!"a[0] < b[0]"(); auto index = X.MAKE_IDX!"a < b"; auto cost1 = new long[](Q+1); { long lastW; long xwi; foreach (ii, i; index) { long w, c; long pos = X[i]; while (xwi < N) { auto e = xw[xwi]; if (e[0] > pos) break; c += (pos - e[0]) * e[1]; w += e[1]; ++xwi; } cost1[ii+1] = cost1[ii] + c; if (lastW != 0) cost1[ii+1] += (pos - X[index[ii-1]]) * lastW; lastW += w; } } auto cost2 = new long[](Q+1); { long lastW; long xwi = N-1; foreach_reverse (ii, i; index) { long w, c; long pos = X[i]; while (xwi >= 0) { auto e = xw[xwi]; if (e[0] < pos) break; c += (e[0] - pos) * e[1]; w += e[1]; --xwi; } cost2[ii] = cost2[ii+1] + c; if (lastW != 0) cost2[ii] += (X[index[ii+1]] - pos) * lastW; lastW += w; } } auto ans = new long[](Q); foreach (ii, i; index) { ans[i] = cost1[ii+1] + cost2[ii]; } foreach (e; ans) writeln(e); stdout.flush; debug readln; }