結果

問題 No.1442 I-wate Shortest Path Problem
コンテスト
ユーザー kaikey
提出日時 2021-03-26 23:59:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,001 bytes
コンパイル時間 3,898 ms
コンパイル使用メモリ 221,912 KB
最終ジャッジ日時 2025-01-19 23:42:09
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 2
other WA * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
	for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
	return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
	for (T& in : v) is >> in;
	return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 5e18;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
	lint from, to;
	lint cost;
	Edge() {

	}
	Edge(lint u, lint v, lint c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c = 1) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<char, lint> valchar;

Vl Dijkstra(WeightedGraph& g, Vl& st) {
	Vl dist(SZ(g), INF);
	deque<bool> visited(SZ(g), false);
	priority_queue<plint> que;
	for (lint v : st) {
		que.push({ 0, v });
		dist[v] = 0;
	}
	while (!que.empty()) {
		plint curr = que.top(); que.pop();
		if (visited[curr.second]) continue;
		visited[curr.second] = true;
		if (dist[curr.second] < curr.first) continue;
		for (auto nxt : g[curr.second]) {
			if (visited[nxt.to]) continue;
			if (dist[nxt.to] > dist[curr.second] + nxt.cost) {
				dist[nxt.to] = dist[curr.second] + nxt.cost;
				que.emplace(-dist[nxt.to], nxt.to);
			}
		}
	}
	return dist;
}

typedef pair<lint, Vl> pa;

struct BinaryIndexedTree {
    int n;
    vector<lint> bit;
    BinaryIndexedTree(int n_) : n(n_ + 1), bit(n, 0) {}
    void add(int i, lint x) {
        for (int idx = i; idx < n; idx += (idx & -idx)) {
            bit[idx] += x;
        }
    }
    lint sum(int i) {
        lint s = 0;
        for (int idx = i; idx > 0; idx -= (idx & -idx)) {
            s += bit[idx];
        }
        return s;
    }
    int lower_bound(lint w) {
        if (w <= 0) {
            return 0;
        }
        else {
            int x = 0, r = 1;
            while (r < n) r = r << 1;
            for (int len = r; len > 0; len = len >> 1) {
                if (x + len < n && bit[x + len] < w) {
                    w -= bit[x + len];
                    x += len;
                }
            }
            return x;
        }
    }
    void show() {
        for (int i = 0; i < n - 1; i++) {
            cout << sum(i) - sum(i - 1) << " ";
        }
        cout << endk;
    }
};

struct ExtendBinaryIndexedTree {
public:
    ExtendBinaryIndexedTree(int _n) { init(_n); }
    //半開区間[l, r)
    void add(int l, int r, lint x) {
        add_sub(0, l, -x * (l - 1));
        add_sub(0, r, x * (r - 1));
        add_sub(1, l, x);
        add_sub(1, r, -x);
    }
    //区間[0, i)
    lint sum(int i) {
        return sum_sub(0, i) + sum_sub(1, i) * i;
    }

    void show() {
        for (int i = 0; i < n - 1; i++) {
            cout << sum(i + 1) - sum(i) << " ";
        }
        cout << endk;
    }
private:
    int n;
    vector<lint> bit[2];
    void init(int _n) {
        n = _n + 1;
        bit[0].assign(n, 0);
        bit[1].assign(n, 0);
    }
    void add_sub(int p, int i, lint x) {
        for (int idx = i; idx < n; idx += (idx & -idx)) {
            bit[p][idx] += x;
        }
    }
    lint sum_sub(int p, int i) {
        lint s = 0;
        for (int idx = i; idx > 0; idx -= (idx & -idx)) {
            s += bit[p][idx];
        }
        return s;
    }
};

template< typename G >
struct DoublingLowestCommonAncestor {
	int LOG = 2;
	vector< int > dep;
	const G& g;
	vector< vector< int > > table;

	DoublingLowestCommonAncestor(const G& g) : g(g), dep(g.size()) {
		int curr = 1;
		while (curr < g.size()) {
			curr *= 2;
			LOG++;
		}
		table.assign(LOG, vector< int >(g.size(), -1));
	}

	void dfs(int idx, int par, int d) {
		table[0][idx] = par;
		dep[idx] = d;
		for (auto& to : g[idx]) {
			if (to != par) dfs(to, idx, d + 1);
		}
	}

	void build() {
		dfs(0, -1, 0);
		for (int k = 0; k + 1 < LOG; k++) {
			for (int i = 0; i < table[k].size(); i++) {
				if (table[k][i] == -1) table[k + 1][i] = -1;
				else table[k + 1][i] = table[k][table[k][i]];
			}
		}
	}

	int query(int u, int v) {
		if (dep[u] > dep[v]) swap(u, v);
		for (int i = LOG - 1; i >= 0; i--) {
			if (((dep[v] - dep[u]) >> i) & 1) v = table[i][v];
		}
		if (u == v) return u;
		for (int i = LOG - 1; i >= 0; i--) {
			if (table[i][u] != table[i][v]) {
				u = table[i][u];
				v = table[i][v];
			}
		}
		return table[0][u];
	}
};



lint N, K, u, v, c, M, P, Q;
int main() {
	cin >> N >> K;
	WeightedGraph to(N + K);
	VVl g(N);
	REP(i, N - 1) {
		cin >> u >> v >> c; u--; v--;
		to[u].push_back({ v, c });
		to[v].push_back({ u, c });
		g[u].push_back(v);
		g[v].push_back(u);
	}
    BinaryIndexedTree tree(2 * N);
	DoublingLowestCommonAncestor lca(g);
	lca.build();
    Vl in(N), out(N);
    lint idx = 1;
    auto dfs = [&](auto&& dfs, lint curr, lint prv, lint cost) -> void {
        in[curr] = idx;
        idx++;
        tree.add(in[curr], cost);
        for (auto e : to[curr]) {
            if (e.to == prv) continue;
            dfs(dfs, e.to, curr, e.cost);
        }
        out[curr] = idx;
        idx++;
        tree.add(out[curr], -cost);
    };
    dfs(dfs, 0, -1, 0);
    return 0;
	V<pa> arr(K);
    VVl _arr(K);
	REP(i, K) {
		cin >> M >> P;
        _arr[i].assign(M, 0);
        cin >> _arr[i];
        REP(j, M) {
            _arr[i][j]--;
            to[_arr[i][j]].push_back({ N + i, P });
            to[N + i].push_back({ _arr[i][j], 0 });
        }
        arr[i] = { P, _arr[i] };
	}
    REP(i, K) {
        arr[i].second = Dijkstra(to, _arr[i]);
    }

	cin >> Q;
	REP(i, Q) {
		cin >> u >> v; u--; v--;
		lint minv = INF;
		REP(j, K) {
			chmin(minv, arr[j].second[u] + arr[j].second[v] + arr[j].first);
		}
		lint _lca = lca.query(u, v);
		chmin(minv, tree.sum(in[u]) + tree.sum(in[v]) - tree.sum(in[_lca]) * 2);
        cout << minv << endk;
	}
}
0