結果
問題 | No.1950 片道きゃっちぼーる |
ユーザー | daut-dlang |
提出日時 | 2022-05-21 00:19:22 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 990 ms / 3,000 ms |
コード長 | 2,925 bytes |
コンパイル時間 | 873 ms |
コンパイル使用メモリ | 116,148 KB |
実行使用メモリ | 49,108 KB |
最終ジャッジ日時 | 2023-09-04 17:15:29 |
合計ジャッジ時間 | 10,342 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 258 ms
37,384 KB |
testcase_04 | AC | 275 ms
37,872 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 285 ms
40,456 KB |
testcase_07 | AC | 225 ms
36,244 KB |
testcase_08 | AC | 251 ms
34,552 KB |
testcase_09 | AC | 335 ms
43,824 KB |
testcase_10 | AC | 265 ms
38,300 KB |
testcase_11 | AC | 256 ms
37,648 KB |
testcase_12 | AC | 266 ms
38,752 KB |
testcase_13 | AC | 284 ms
40,604 KB |
testcase_14 | AC | 328 ms
40,696 KB |
testcase_15 | AC | 990 ms
49,108 KB |
testcase_16 | AC | 304 ms
39,976 KB |
testcase_17 | AC | 1 ms
4,384 KB |
testcase_18 | AC | 261 ms
35,060 KB |
testcase_19 | AC | 893 ms
48,216 KB |
testcase_20 | AC | 216 ms
34,620 KB |
testcase_21 | AC | 309 ms
40,032 KB |
testcase_22 | AC | 300 ms
40,296 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)); } double euDist(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return sqrt(cast(double)c.sum); } double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; } double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); } double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; } //long mod = 10^^9 + 7; long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { auto N = RD; auto X = RDA; auto A = RDA; long[long] pos; foreach (i; 0..N) pos[X[i]] = i; auto edges = new long[][](N); foreach (i; 0..N) { auto l = pos.get(X[i]-A[i], -1); auto r = pos.get(X[i]+A[i], -1); if (l != -1) edges[l] ~= i; if (r != -1) edges[r] ~= i; } auto ans = new long[](N); foreach (i; 0..N) ans[i] = X[i] + A[i]; auto index = ans.MAKE_IDX!"a > b"; long[] q; foreach (i; index) q ~= i; while (!q.empty) { auto u = q.front; q.popFront; foreach (v; edges[u]) { if (ans[v] < ans[u]) { ans[v] = ans[u]; q ~= v; } } } foreach (i; 0..N) writeln(ans[i] - X[i]); stdout.flush; debug readln; }