Submission #1559838

---

Source Code Expand

/+ dub.sdl:
    name "A"
    dependency "dcomp" version=">=0.6.0"
+/

import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.foundation, dcomp.scanner;

import std.typecons;

int main() {
    auto sc = new Scanner(stdin);

    long x;
    int k;
    long[] r;
    int q;
    long[] t, a;
    sc.read(x, k, r, q);
    t = new long[q]; a = new long[q];
    iota(q).each!(i => sc.read(t[i], a[i]));

    alias Q = Tuple!(long, int);
    Q[] ev;
    foreach (i; 0..k) {
        ev ~= Q(r[i], -1);
    }
    foreach (i; 0..q) {
        ev ~= Q(t[i], i);
    }
    ev.sort!"a<b";

    long d = 0, e = 0, f = x, g = x;
    bool suc = true;
    long tm = 0;
    long[] res = new long[q];

    foreach (que; ev) {
        long di = que[0] - tm;
        int ty = que[1];
        if (suc) {
            d -= di; g -= di;
            if (d < 0) {
                e += -d;
                d = 0;
            }
            if (g <= 0) {
                d = 0; e = 0; f = 0; g = 0;
            }
        } else {
            d += di; g += di;
            if (x < g) {
                f -= g-x;
                g = x;
            }
            if (x <= d) {
                d = x; e = x; f = x; g = x;
            }
        }
//        writefln("time %d: %d %d %d %d", tm+di, d, e, f, g);
        
        if (ty == -1) {
            //reverse
            suc = !suc;
        } else {
            if (a[ty] <= e) {
                res[ty] = d;
            } else if (f <= a[ty]) {
                res[ty] = g;
            } else {
                res[ty] = d + a[ty] - e;
            }
        }
        tm = que[0];
    }
    writeln(res.map!(to!string).join("\n"));
    return 0;
}
/* IMPORT /home/yosupo/Program/dcomp/source/dcomp/foundation.d */
// module dcomp.foundation;
 
static if (__VERSION__ <= 2070) {
    template fold(fun...) if (fun.length >= 1) {
        auto fold(R, S...)(R r, S seed) {
            import std.algorithm : reduce;
            static if (S.length < 2) {
                return reduce!fun(seed, r);
            } else {
                import std.typecons : tuple;
                return reduce!fun(tuple(seed), r);
            }
        }
    }
     
}
version (X86) static if (__VERSION__ < 2071) {
    import core.bitop : bsf, bsr, popcnt;
    int bsf(ulong v) {
        foreach (i; 0..64) {
            if (v & (1UL << i)) return i;
        }
        return -1;
    }
    int bsr(ulong v) {
        foreach_reverse (i; 0..64) {
            if (v & (1UL << i)) return i;
        }
        return -1;   
    }
    int popcnt(ulong v) {
        int c = 0;
        foreach (i; 0..64) {
            if (v & (1UL << i)) c++;
        }
        return c;
    }
}
/* IMPORT /home/yosupo/Program/dcomp/source/dcomp/scanner.d */
// module dcomp.scanner;

 
class Scanner {
    import std.stdio : File;
    import std.conv : to;
    import std.range : front, popFront, array, ElementType;
    import std.array : split;
    import std.traits : isSomeChar, isStaticArray, isArray; 
    import std.algorithm : map;
    File f;
    this(File f) {
        this.f = f;
    }
    char[512] lineBuf;
    char[] line;
    private bool succ() {
        import std.range.primitives : empty, front, popFront;
        import std.ascii : isWhite;
        while (true) {
            while (!line.empty && line.front.isWhite) {
                line.popFront;
            }
            if (!line.empty) break;
            if (f.eof) return false;
            line = lineBuf[];
            f.readln(line);
        }
        return true;
    }

    private bool readSingle(T)(ref T x) {
        import std.algorithm : findSplitBefore;
        import std.string : strip;
        import std.conv : parse;
        if (!succ()) return false;
        static if (isArray!T) {
            alias E = ElementType!T;
            static if (isSomeChar!E) {
                 
                 
                auto r = line.findSplitBefore(" ");
                x = r[0].strip.dup;
                line = r[1];
            } else {
                auto buf = line.split.map!(to!E).array;
                static if (isStaticArray!T) {
                     
                    assert(buf.length == T.length);
                }
                x = buf;
                line.length = 0;
            }
        } else {
            x = line.parse!T;
        }
        return true;
    }
    int read(T, Args...)(ref T x, auto ref Args args) {
        if (!readSingle(x)) return 0;
        static if (args.length == 0) {
            return 1;
        } else {
            return 1 + read(args);
        }
    }
}


 
 

 

Submission Info

Judge Result