結果

問題 No.2294 Union Path Query (Easy)
ユーザー Ecrade_
提出日時 2023-05-05 23:01:28
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 484 ms / 4,000 ms
コード長 2,136 bytes
コンパイル時間 1,996 ms
コンパイル使用メモリ 170,580 KB
実行使用メモリ 144,076 KB
最終ジャッジ日時 2024-11-23 11:12:02
合計ジャッジ時間 16,435 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll t = 1,n,m,k,q,l,r,a,b,c,u,v,x,y,z,o,X,hd[200009],tot,cnt[200009][39][2],rt[200009],id[200009],sz[200009],dis[200009],ans[200009];
string s;
struct st{ll x,y,z; /*bool operator < (const st &a) const{return x < a.x;};*/}eg[400009];
void addedge(ll u,ll v,ll w){eg[++ tot] = (st){v,hd[u],w},hd[u] = tot;}
bool cmp(const st &a,const st &b){return a.x < b.x;}
inline ll read(){
    ll s = 0,w = 1;
    char ch = getchar();
    while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
    while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
    return s * w;
}
ll qp(ll x,ll y){
    ll a = 1,b = x;
    while (y){
        if (y & 1) a = a * b % mod;
        b = b * b % mod,y >>= 1;
    }
    return a;
}
inline void add(ll &x,ll y){x += y; if (x >= mod) x -= mod;}
ll find(ll x){return x == id[x] ? x : id[x] = find(id[x]);}
void dfs(ll u,ll fa,ll rt){
    for (ll i = 0;i < 30;i += 1) add(ans[rt],cnt[rt][i][((dis[u] >> i) & 1) ^ 1] * (1ll << i) % mod);
    for (ll i = 0;i < 30;i += 1) cnt[rt][i][(dis[u] >> i) & 1] += 1;
    for (ll i = hd[u];i;i = eg[i].y){
        ll v = eg[i].x;
        if (v == fa) continue;
        dis[v] = dis[u] ^ eg[i].z,dfs(v,u,rt);
    }
}
void merge(ll x,ll y,ll z){
    ll qwq = find(x),awa = find(y);
    if (qwq == awa) return;
    if (sz[qwq] > sz[awa]) swap(x,y),swap(qwq,awa);
    id[qwq] = awa,sz[awa] += sz[qwq],sz[qwq] = 0;
    dis[x] = dis[y] ^ z,addedge(x,y,z),addedge(y,x,z),dfs(x,y,awa);
}
ll query(ll x,ll y){
    return dis[x] ^ dis[y];
}
int main(){//t = read();
while (t --){
    n = read(),X = read() + 1,q = read();
    for (ll i = 1;i <= n;i += 1){
        rt[i] = id[i] = i,sz[i] = 1;
        for (ll j = 0;j < 30;j += 1) cnt[i][j][0] = 1;
    }
    while (q --){
        o = read();
        if (o == 1){
            x = read() + 1,y = read();
            merge(x,X,y);
        }
        if (o == 2){
            x = read() + 1,y = read() + 1;
            if (find(x) != find(y)) puts("-1");
            else{
                ll qwq = query(x,y);
                X += qwq;
                printf("%lld\n",qwq);
            }
        }
        if (o == 3){
            x = read() + 1;
            printf("%lld\n",ans[find(x)]);
        }
        if (o == 4) X += read();
        X = (X + n - 1) % n + 1;
    }
}
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0