Submission #538715

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include <cassert>
#include <set>
#include <cstring>

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

/**
 * Link-Cut Tree
 *
 * 機能としては、link、cut、evert、parent, rootを実装済み
 * 辺に値を持たせたい場合は頂点倍加
 */
struct LCNode {
    typedef LCNode* NP;

    typedef int D;
    struct Node {
        int d, mi;
    } n;
    LCNode() : l(nullptr), r(nullptr), sz(0), rev(false) {
        n.d = n.mi = 1e9+1;
    }
    LCNode(int d) : p(nullptr), l(last), r(last), sz(1), rev(false) {
        n.d = n.mi = d;
    }

    NP update() {
        assert(this != last);
        sz = 1+l->sz+r->sz;
        n.mi = n.d;
        if (l->sz) {
            n.mi = min(n.mi, l->n.mi);
        }
        if (r->sz) {
            n.mi = min(n.mi, r->n.mi);
        }
        return this;
    }
    void push() {
        int lsz = l->sz, rsz = r->sz;
        if (rev) {
            if (lsz) {
                l->revdata();
            }
            if (rsz) {
                r->revdata();
            }
            rev = false;
        }
    }
    void revdata() {
        assert(this != last);
        swap(l, r);
        rev ^= true;
    }

    NP search(int x) {
        push();
        if (r->n.mi <= x) {
            return r->search(x);
        }
        if (n.d <= x) {
            expose();
            return this;
        }
        if (l->n.mi <= x) {
            return l->search(x);
        }
        expose();
        return nullptr;
    }
    //ここから
    static LCNode last_d;
    static NP last;
    NP p, l, r;
    int sz;
    bool rev;
    inline int pos() {
        if (p) {
            if (p->l == this) return -1;
            if (p->r == this) return 1;
        }
        return 0;
    }
    void rot() {
        NP qq = p->p;
        int pps = p->pos();
        if (p->l == this) {
            p->l = r; r->p = p;
            r = p; p->p = this;
        } else {
            p->r = l; l->p = p;
            l = p; p->p = this;
        }
        p->update(); update();
        p = qq;
        if (!pps) return;
        if (pps == -1) {
            qq->l = this;
        } else {
            qq->r = this;
        }
        qq->update();
    }
    void splay() {
        assert(this != last);
        supush();
        int ps;
        while ((ps = pos())) {
            int pps = p->pos();
            if (!pps) {
                rot();
            } else if (ps == pps) {
                p->rot(); rot();
            } else {
                rot(); rot();
            }
        }
    }
    void expose() {
        assert(this != last);
        NP u = this, ur = last;
        do {
            u->splay();
            u->r = ur;
            u->update();
            ur = u;
        } while ((u = u->p));
        splay();
    }
    /**
     * splayする前に一括でその頂点のパス木の根までをpushする
     * 唯一stack overflowしうる関数なので注意すること
     */
    void supush() {
        if (pos()) {
            p->supush();
        }
        push();
    }
    //ここまでは絶対必要

    void link(NP r) {
        assert(this != r);
        expose();
        r->expose();
        assert(l == last);
        p = r;
    }

    void cut() {
        expose();
        l->p = NULL;
        l = last;
        update();
    }

    NP root() {
        expose();
        NP u = this;
        while (u->l != last) {
            u = u->l;
            u->push();
        }
        u->expose(); //これを忘れると計算量がオワコンする
        return u;
    }

    NP parent() {
        expose();
        NP u = this->l;
        if (u == last) return nullptr;
        u->push();
        while (u->r != last) {
            u = u->r;
            u->push();
        }
        u->expose();
        return u;
    }

    void evert() {
        expose();
        revdata();
    }

    NP lca(NP n) {
        n->expose();
        expose();
        NP t = n;
        while (n->p != nullptr) {
            if (!n->pos()) t = n->p;
            n = n->p;
        }
        return (this == n) ? t : nullptr;
    }
};
LCNode LCNode::last_d = LCNode();
LCNode::NP LCNode::last = &last_d;

const int MN = 100100;
LCNode tr[MN];

int main() {
    int n, q;
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        tr[i] = LCNode(a);
    }

    for (int i = 0; i < n-1; i++) {
        int b, c;
        cin >> b >> c; b--; c--;
        tr[b].evert();
        tr[b].link(tr + c);
    }

    for (int i = 0; i < q; i++) {
        int x, v, w;
        cin >> x >> v >> w; v--; w--;
        tr[w].evert();
        tr[v].expose();
        LCNode* t = tr+v;
        while (true) {
            t = t->search(x);
            if (t == nullptr) break;
//            printf("se %d \n", t->n.d);
            x %= t->n.d;
        }
        cout << x << endl;
    }
	return 0;
}

Submission Info

Judge Result