// URL: https://yukicoder.me/problems/no/704 import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string; version(unittest) {} else void main() { int n; io.getV(n); long[] a; io.getA(n, a); long[] x; io.getA(n, x); long[] y; io.getA(n, y); auto dp = new long[](n+1), st1 = new SegTree(n, inf), st2 = new SegTree(n, inf); foreach (i; 0..n) { st1[i] = dp[i]+y[i]-x[i]; st2[i] = dp[i]+y[i]+x[i]; auto p = x[0..i+1].assumeSorted.lowerBound(a[i]).length; dp[i+1] = min(st1[0..p]+a[i], st2[p..i+1]-a[i]); } io.put(dp[n]); } const inf = 10L^^18; alias SegTree = SegmentTree!(min, long); class SegmentTree(alias pred = "a+b", T) { import std.functional; alias predFun = binaryFun!pred; const size_t n; @property auto data() { return buf[an..an+n]; } this(size_t n, T dflt = T.init) { this.n = n; this.dflt = dflt; an = (n-1).nextPow2; buf = new T[](an*2); if (T.init != dflt) { buf[an..an+n][] = dflt; propagateAll(); } } this(T[] init, T dflt = T.init) { this.n = init.length; this.dflt = dflt; an = (n-1).nextPow2; buf = new T[](an*2); buf[an..an+n][] = init[]; propagateAll(); } void opIndexAssign(T val, size_t i) { buf[i+=an] = val; propagate(i); } void opIndexOpAssign(string op)(T val, size_t i) { mixin("buf[i+=an]"~op~"=val;"); propagate(i); } void opIndexUnary(string op)(size_t i) if (op=="++"||op=="--") { mixin(op~"buf[i+=an];"); propagate(i); } pure T opIndex(size_t i) { return buf[i+an]; } pure T opSlice(size_t l, size_t r) { l += an; r += an; T r1 = dflt, r2 = dflt; while (l != r) { if (l % 2) r1 = predFun(r1, buf[l++]); if (r % 2) r2 = predFun(buf[--r], r2); l /= 2; r /= 2; } return predFun(r1, r2); } pure size_t opDollar() { return n; } private { const size_t an; const T dflt; T[] buf; void propagateAll() { foreach_reverse (i; 1..an) buf[i] = predFun(buf[i*2], buf[i*2+1]); } void propagate(size_t i) { while (i /= 2) buf[i] = predFun(buf[i*2], buf[i*2+1]); } } } SegmentTree!(pred, T) segmentTree(alias pred = "a+b", T)(size_t n, T dflt = T.init) { return new SegmentTree!(pred, T)(n, dflt); } SegmentTree!(pred, T) segmentTree(alias pred = "a+b", T)(T[] init, T dflt = T.init) { return new SegmentTree!(pred, T)(init, dflt); } 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); } } }