第十三届山东省ICPC大学生程序设计竞赛 J. Not Another Path Query Problem

题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = 1e6;
 const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];
int n, m;
int a[maxn];

string s;

struct Node{
    // int val, id;
    // bool operator<(const Node &u)const{
    //     return val < u.val;//!!!!!!!!!!!!!!!!!!
    // }
    int v, w;
};

//long long ? maxn ? n? m?
void solve(){
    int res = 0;
    int n, m, q, V;
    cin >> n >> m >> q >> V;
    vector<vector<pair<int, int>>> G(n + 5);
    for(int i = 1; i <= m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        G[u].pb({v, w});
        G[v].pb({u, w});
    }
    vector<pair<int, int>> Q;
    vector<bool> ans(q + 5, 0);
    for(int i = 1; i <= q; i++){
        int u, v;
        cin >> u >> v;
        Q.pb({u, v});
    }
    auto check = [&](int x) -> void {
        vector<int> col(n + 5, 0);
        for(int i = 1; i <= n; i++){
            if(col[i]){
                continue;
            }
            queue<int> q;
            q.push(i);
            col[i] = i;
            while(!q.empty()){
                int u = q.front();
                q.pop();
                for(auto [v, w] : G[u]){
                    if(col[v] || (w & x) != x) continue;
                    col[v] = col[u];
                    q.push(v);
                }
            }
        }
        for(int i = 0; i < q; i++){
            if(col[Q[i].first] == col[Q[i].second]){
                ans[i] = 1;
            }
        }
    };
    for(int j = 59; j >= 0; j--){
        if(~V >> j & 1){
            int x = V >> j << j | (1LL << j);
            check(x);
        }
    }
    check(V);//V也得check!!!!!!!!!!!!!!!!
    for(int i = 0; i < q; i++){
        if(ans[i]) cout << "Yes\n";
        else cout << "No\n";
    }
}   
    
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int T = 1;
    // cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}