#1142986 (C++17) No.1600 Many Shortest Path Problems

• 問題: No.1600 Many Shortest Path Problems
• ユーザー: 👑 potato167
• 提出日時: 2026-01-06 17:58:55
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 9,493 bytes
• コンパイル時間: 3,619 ms
• コンパイル使用メモリ: 254,204 KB
• 実行使用メモリ: 73,552 KB
• 最終ジャッジ日時: 2026-01-06 17:59:17
• 合計ジャッジ時間: 18,302 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 26 WA * 25

ソースコード

#line 1 "d.cpp"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

namespace po167{
    struct UF
    {
        using _F = int;
        int _n;
        std::vector<_F> wei;
        std::vector<int> q;
        int component;
        UF(int n):_n(n), wei(n), component(n), par(n){
            for (int i = 0; i < n; i++){
                wei[i] =1, par[i] = i;
            }
        }
        void intialize(){
            for (auto x : q){
                wei[root(x)] = 1;
                par[x] = x;
                wei[x] = 1;
            }
            component = (int)par.size();
            q = {};
        }
        //根っこを返す
        int root(int a){
            assert(0 <= a && a < _n);
            if (a == par[a]) return a;
            return par[a] = root(par[a]);
        }
        //trueなら1,falseなら0
        int same(int a, int b){
            assert(0 <= a && a < _n);
            assert(0 <= b && b < _n);
            if(root(a) == root(b)) return 1;
            else return 0;
        }
        _F size(int a){
            return wei[root(a)];
        }
        //a,bが違う根っこの元なら結合する,結合したらtrueを返す
        bool unite(int a,int b){
            a = root(a), b = root(b);
            if (a == b) return false;
            if (wei[a] < wei[b]) std::swap(a, b);
            par[b] = a;
            q.push_back(b);
            wei[a] += wei[b];
            component--;
            return true;
        }
    private:
        std::vector<int> par;
    };
}
using po167::UF;

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
#line 4 "/Users/Shared/po167_library/ds/Sparse_table.hpp"
namespace po167{
template<class T, T(*op)(T, T)>
struct Sparse_table{
    int n;
    int depth;
    std::vector<std::vector<T>> val;
    void init(std::vector<T> &v){
        depth = 1;
        n = v.size();
        while ((1 << depth) <= n) depth++;
        val.resize(depth);
        val[0] = v;
        for (int i = 1; i < depth; i++){
            val[i].resize(n);
            for (int j = 0; j <= n - (1 << i); j++){
                val[i][j] = op(val[i - 1][j], val[i - 1][j + (1 << (i - 1))]);
            }
        }
    }
    Sparse_table(std::vector<T> v){
        init(v);
    }
    Sparse_table(){}
    // 0 <= l < r <= n
    // if l == r : assert
    T prod(int l, int r){
        assert(0 <= l && l < r && r <= n);
        int z=31-__builtin_clz(r-l);
        return op(val[z][l], val[z][r - (1 << z)]);
    }
};
}
#line 6 "/Users/Shared/po167_library/graph/tree/LCA.hpp"
namespace po167{
int op(int a, int b){
    return std::min(a, b);
}
struct LCA{
    Sparse_table<int, op> table;
    std::vector<int> depth;
    std::vector<int> E;
    std::vector<int> order;
    int var_num;
    void init(std::vector<std::vector<int>> &g, int root = 0){
        var_num = g.size();
        assert(0 <= root && root < var_num);
        std::vector<int> val;
        depth.assign(var_num, -1);
        depth[root] = 0;
        E.resize(var_num);
        std::vector<int> tmp;
        order.clear();
        tmp.reserve(var_num);
        order.reserve(var_num);
        int c = 0;
        auto dfs = [&](auto self, int var, int pare) -> void {
            E[var] = c++;
            if (var != root) tmp.push_back(E[pare]);
            order.push_back(var);
            for (auto x : g[var]) if (depth[x] == -1){
                depth[x] = depth[var] + 1;
                self(self, x, var);
            }
        };
        dfs(dfs, root, -1);
        assert(c == var_num);
        table.init(tmp);
    }
    void init(std::vector<int> &pare){
        int root = -1;
        int n = pare.size();
        std::vector<std::vector<int>> g(n);
        for (int i = 0; i < n; i++){
            if (pare[i] < 0){
                assert(root == -1);
                root = i;
            }
            else{
                assert(0 <= pare[i] && pare[i] < n);
                g[pare[i]].push_back(i);
            }
        }
        assert(root != -1);
        init(g, root);
    }
    LCA (std::vector<std::vector<int>> g, int root = 0){
        init(g, root);
    }
    LCA (std::vector<int> pare){
        init(pare);
    }
    LCA(){
        
    }
    int lca(int a, int b){
        assert(0 <= std::min(a, b) && std::max(a, b) < var_num);
        if (a == b) return a;
        if (E[a] > E[b]) std::swap(a, b);
        return order[table.prod(E[a], E[b])];
    }
    int dist(int a, int b){
        assert(0 <= std::min(a, b) && std::max(a, b) < var_num);
        return depth[a] + depth[b] - 2 * depth[lca(a, b)];
    }
    int back(int var, int len){
        assert(len <= depth[var]);
        if (len == 0) return var;
        int l = 0, r = E[var];
        while (r - l > 1){
            int m = (l + r) / 2;
            if (depth[var] - depth[order[table.prod(m, E[var])]] < len){
                r = m;
            }
            else l = m;
        }
        return order[table.prod(l, E[var])];
    }
    // a -> b
    int jump(int a, int b, int len){
        int c = lca(a, b);
        if (len <= depth[a] - depth[c]) return back(a, len);
        len -= depth[a] - depth[c];
        if (len <= depth[b] - depth[c]) return back(b, depth[b] - depth[c] - len);
        return -1;
    }
};

}
#line 83 "d.cpp"

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, M;
    cin >> N >> M;
    vector<int> use(M, -1);
    UF T(N);
    vector<mint> p2(M, 1);
    rep(i, 1, M) p2[i] = p2[i - 1] * 2;
    struct edge{
        int to;
        int ind;
    };
    vector<int> A(M), B(M);
    vector<vector<edge>> G(N);
    vector<vector<int>> lcaG(N);
    vector<edge> pare(N);
    vector<mint> W(N);
    vector<set<int>> rem(N);
    rep(i, 0, M){
        cin >> A[i] >> B[i];
        A[i]--, B[i]--;
        if (T.unite(A[i], B[i])){
            G[A[i]].push_back({B[i], i});
            G[B[i]].push_back({A[i], i});
            lcaG[A[i]].push_back(B[i]);
            lcaG[B[i]].push_back(A[i]);
        }
        else{
            rem[A[i]].insert(i);
            rem[B[i]].insert(i);
        }
    }
    po167::LCA l(lcaG);
    vector<int> order;
    {
        auto dfs = [&](auto self, int var, int p) -> void {
            for (auto x : G[var]) if (x.to != p){
                pare[x.to] = {var, x.ind};
                W[x.to] = W[var] + p2[x.ind];
                use[x.ind] = x.to;
                self(self, x.to, var);
            }
            order.push_back(var);
        };
        dfs(dfs, 0, -1);
    }
    auto dist_W = [&](int a, int b) -> mint {
        int c = l.lca(a, b);
        return W[a] + W[b] - W[c] * 2;
    };
    vector<int> lig(M, -1);
    for (auto id : order) if (id){
        if (!rem[id].empty()){
            lig[pare[id].ind] = (*rem[id].begin());
        }
        if (rem[pare[id].to].size() < rem[id].size()){
            swap(rem[pare[id].to], rem[id]);
        }
        for (auto x : rem[id]){
            if (rem[pare[id].to].insert(x).second){
                rem[pare[id].to].erase(x);
            }
        }
    }
    int Q;
    cin >> Q;
    while (Q--){
        int x, y, z;
        cin >> x >> y >> z;
        x--, y--, z--;
        mint ans = 0;
        if (use[z] == -1){
            ans = dist_W(x, y);
        }
        else if (l.dist(x, y) * 2 != l.dist(x, A[z]) + l.dist(y, A[z]) + l.dist(x, B[z]) + l.dist(y, B[z])){
            ans = dist_W(x, y);
        }
        else if (lig[z] == -1){
            cout << "-1\n";
            continue;
        }
        else{
            int c = lig[z];
            if (l.dist(x, A[z]) - l.dist(x, B[z]) != l.dist(A[c], A[z]) - l.dist(A[c], B[z])){
                swap(x, y);
            }
            ans = dist_W(x, A[c]) + dist_W(y, B[c]) + p2[c];
        }
        cout << (ans * 2).val() << "\n";
    }
}