結果
問題 | No.728 ギブ and テイク |
ユーザー |
|
提出日時 | 2020-01-28 15:52:58 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 485 ms / 3,000 ms |
コード長 | 3,256 bytes |
コンパイル時間 | 1,593 ms |
コンパイル使用メモリ | 159,892 KB |
実行使用メモリ | 30,204 KB |
最終ジャッジ日時 | 2024-06-22 04:42:35 |
合計ジャッジ時間 | 7,230 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
// URL: https://yukicoder.me/problems/no/728import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;version(unittest) {} elsevoid main(){int N; io.getV(N);int[] A; io.getA(N, A);int[] L, R; io.getC(N, L, R);struct B { int x, i, t; }auto b = new B[](N*2);foreach (i; 0..N) {b[i] = B(A[i], i, 0);b[i+N] = B(A[i]-L[i], i, 1);}b.multiSort!("a.x<b.x", "a.t>b.t");auto as = A.assumeSorted, ft = fenwickTree!int(N), ans = 0L;foreach (bi; b) {auto i = bi.i;switch (bi.t) {case 0:auto k = as.lowerBound(A[i]+R[i]+1).length;ans += ft[i+1..k];break;case 1:++ft[i];break;default:assert(0);}}io.put(ans);}class FenwickTree(T){const size_t n;this(size_t n) { this.n = n; this.buf = new T[](n+1); }void opIndexOpAssign(string op)(T val, size_t i) if (op=="+"||op=="-"){ ++i; for (; i <= n; i += i&-i) mixin("buf[i]"~op~"=val;"); }void opIndexUnary(string op)(size_t i) if (op=="++"||op=="--"){ ++i; for (; i <= n; i += i&-i) mixin(op~"buf[i];"); }pure T opIndex(size_t i) { return opSlice(i, i+1); }pure T opSlice(size_t r, size_t l) { return get(l) - get(r); }pure size_t opDollar() { return n; }private{T[] buf;pure T get(size_t i){auto s = T(0);for (; i > 0; i -= i & -i) s += buf[i];return s;}}}FenwickTree!T fenwickTree(T)(size_t n) { return new FenwickTree!T(n); }auto io = IO!()();import std.stdio;struct IO(string floatFormat = "%.10f", string delimiter = " ", alias IN = stdin, alias OUT = stdout){import std.conv, std.format, std.meta, std.traits;auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T){ v = new T(n); foreach (ref w; v) get(w); }auto getC(T...)(size_t n, ref T v)if (allSatisfy!(hasAssignableElements, T)){foreach (ref w; v) w = new typeof(w)(n);foreach (i; 0..n) foreach (ref w; v) get(w[i]);}auto getM(T)(size_t r, size_t c, ref T v)if (hasAssignableElements!T && hasAssignableElements!(ElementType!T)){v = new T(r); foreach (ref w; v) getA(c, w);}template getS(E...){auto getS(T)(size_t n, ref T v){v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");}}auto put(bool flush = false, T...)(T v){foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); }OUT.writeln;static if (flush) OUT.flush();}auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); }auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }private{dchar[] buf;auto sp = (new dchar[](0)).splitter;void nextLine() { IN.readln(buf); sp = buf.splitter; }auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }auto putR(T)(T v){auto w = v;while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); }}auto putA(T)(T v){static if (isInputRange!T && !isSomeString!T) putR(v);else if (isFloatingPoint!T) OUT.write(format(floatFormat, v));else OUT.write(v);}}}