#548947 (C++17) No.1212 Second Path

提出ソース

結果

問題	No.1212 Second Path
ユーザー	haruki_K
提出日時	2020-09-06 10:34:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	11,194 bytes
コンパイル時間	2,861 ms
コンパイル使用メモリ	236,628 KB
実行使用メモリ	44,204 KB
最終ジャッジ日時	2024-05-06 20:40:59
合計ジャッジ時間	14,625 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,288 ms 40,540 KB
testcase_01	TLE	-
testcase_02	--	-
testcase_03	--	-
testcase_04	--	-
testcase_05	--	-
testcase_06	--	-
testcase_07	--	-
testcase_08	--	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<
// >>> reord

void reord_impl(vector<int> const&) { }
template <class C, class... Args>
void reord_impl(vector<int> const& idx, C& v, Args&&... args) {
    auto t = v;
    rep (i,v.size()) t[i] = v[idx[i]];
    swap(v,t);
    reord_impl(idx, forward<Args>(args)...);
}
template <class Comp, class C, class... Args,
          class = decltype(declval<Comp>()(0,0))>
void reord(Comp comp, C& v, Args&&... args) {
    vector<int> idx(v.size());
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), comp);
    reord_impl(idx, v, args...);
}
template <class C, class... Args>
void reord(C& v, Args&&... args) {
    vector<int> idx(v.size());
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] < v[j]; });
    reord_impl(idx, v, args...);
}
template <class C, class... Args>
void reordR(C& v, Args&&... args) {
    vector<int> idx(v.size());
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] > v[j]; });
    reord_impl(idx, v, args...);
}

// <<<
// >>> LCA
constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class E> struct LCA {
    vector<vector<E> > const* g;
    int32_t n,lg,root;
    vector<int32_t> d;
    vector<vector<int32_t> > anc;
    LCA() {}
    LCA(vector<vector<E> > const* g, int root = 0)
        : g(g), n(g->size()), root(root), d(n) {
        lg = 1; while ((1<<lg) < n) lg++; // lg == 1 when n <= 1
        anc.assign(lg, vector<int32_t>(n,-1));
        dfs(root);
        rep (i,lg-1) rep (j,n) if (anc[i][j] >= 0) {
            anc[i+1][j] = anc[i][anc[i][j]];
        }
    }
    void dfs(int x, int p = -1) {
        anc[0][x] = p;
        d[x] = (p == -1 ? 0 : d[p]+1);
        for (auto const& e : (*g)[x]) if (dst(e) != p) dfs(dst(e),x);
    }
    int dep(int a) const { return d[a]; }
    int operator()(int a, int b) const { return lca(a,b); }
    int lca(int a, int b) const {
        if (d[a] > d[b]) swap(a,b);
        for (int dd = d[b]-d[a], i = 0; dd; dd >>= 1, i++) {
            if (dd&1) b = anc[i][b];
        }
        if (a == b) return a;
        for (int i = lg-1; i >= 0; i--) {
            if (anc[i][a] != anc[i][b]) a = anc[i][a], b = anc[i][b];
        }
        return anc[0][a];
    }
    int dist(int a, int b) const { return d[a] + d[b] - 2*d[lca(a,b)]; }
    int climb(int v, int dist) const {
        for (int i = 0; dist && v >= 0; dist >>= 1, i++) {
            if (dist&1) v = anc[i][v];
        }
        return v;
    }
};
template <class E>
auto get_lca(vector<vector<E> > const& g, int root = 0) { return LCA<E>(&g,root); }
// <<<
// >>> segment tree
template <class Handler>
struct Segtree : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value

    vector<Value> v; // use v[1..2*cap-1]
    int cap; // // capacity: power of 2
    int n; // original size

    Segtree() {}
    template <class... T> Segtree(T&&... x) { init(forward<T>(x)...); }

    template <class F, class = decltype(declval<F>()(0))>
    void init(int n, F gen)  {
        assert(n >= 0); this->n = n;
        cap = n; //for (cap = 1; cap < n; cap <<= 1) ;;
        v.resize(2*cap, unit());
        for (int i = 0; i < n; i++) v[cap+i] = gen(i);
        for (int i = cap-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]);
    }
    void init(int n) { init(n, [&](int) { return unit(); }); }
    void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
    void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
    int size() const { return n; }

    void set(int i, Value const& x) {
        assert(0 <= i); assert(i < size());
        i += cap; v[i] = x;
        while (i > 1) i >>= 1, v[i] = merge(v[2*i],v[2*i+1]);
    }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const {
        assert(0 <= i); assert(i < size());
        return v[cap + i];
    }
    // [l,r)
    Value get(int l, int r) const {
        assert(0 <= l); assert(l <= r); assert(r <= size());
        Value x = unit(), y = unit();
        for (l += cap, r += cap; l < r; l >>= 1, r >>= 1) {
            if (l&1) x = merge(x, v[l++]);
            if (r&1) y = merge(v[--r], y);
        }
        return merge(x,y);
    }
    vector<Value> dat() const {
        vector<Value> ret(size());
        for (int i = 0; i < size(); i++) ret[i] = get(i);
        return ret;
    }
};
// <<<
struct RangeXor {
    using Value = u64;
    constexpr static Value unit() { return 0; }
    constexpr static Value merge(Value x, Value y) { return x^y; }
};

struct edge { int to,w; };

int32_t main() {
    int n; cin >> n;
    vector<vector<edge>> g(n);
    vector<int> a(n-1),b(n-1),w(n-1);
    rep (i,n-1) {
        cin >> a[i] >> b[i] >> w[i], --a[i],--b[i];
        g[a[i]].pb({b[i],w[i]});
        g[b[i]].pb({a[i],w[i]});
    }
    reord(w,a,b);
    dump(a);
    dump(b);
    dump(w);

    auto lca = get_lca(g);

    vector<int> dep(n), in(n), out(n);
    def (dfs, int x, int p, int d) -> void {
        static int time = 0;
        dep[x] = d;
        in[x] = time;
        for (auto e : g[x]) {
            if (e.to == p) continue;
            time++;
            dfs(e.to,x,d+e.w);
            time++;
        }
        out[x] = time+1;
    };
    dfs(0,-1,0);
    dump(dep);
    dump(in);
    dump(out);

    int q; cin >> q;
    vector<int> x(q),y(q);
    rep (i,q) cin >> x[i] >> y[i], --x[i],--y[i];

    vector<int> l(q,0),r(q,1e10);
    while (true) {
        // dump(l,r);

        static map<int,vector<int>> z;
        z.clear();
        rep (i,q) {
            if (l[i]+1 < r[i]) {
                int mid = (l[i]+r[i])/2;
                z[mid].eb(i);
            }
        }
        if (z.empty()) break;

        static Segtree<RangeXor> seg(2*n);
        fill(all(seg.v),0);
        auto add = [&](int x, u64 val) {
            seg.set(in[x], seg[in[x]]^val);
            seg.set(out[x], seg[out[x]]^val);
        };
        int idx = 0;
        for (auto const& [mid,v] : z) {

            while (idx < n-1 && w[idx] <= mid) {
                auto val = rand(0ull,-1ull);
                add(a[idx], val);
                add(b[idx], val);
                idx++;
            }
            for (int j : v) {
                u64 sum = 0;
                sum ^= seg.get(0,in[x[j]]+1);
                sum ^= seg.get(0,in[y[j]]+1);
                sum ^= seg.get(in[lca(x[j],y[j])]);
                (sum > 0 ? r[j] : l[j]) = mid;
            }
        }
    }
    dump(l);
    dump(r);

    rep (i,q) {
        if (r[i] == int(1e10)) {
            cout << -1 << "\n";
        } else {
            int mi = r[i];
            int len = dep[x[i]] + dep[y[i]] - 2*dep[lca(x[i],y[i])];
            dump(i,x[i],y[i],mi,len);
            cout << len + mi*2 << "\n";
        }
    }

}

yukicoder

結果

テストケース

ソースコード