提出 #63283323

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define endl '\n'
#define pii pair<int,int>
#define Mikari_My_Wife ios::sync_with_stdio(0),cin.tie(0);
#define all(x) x.begin(),x.end()
using namespace std;
int f[1000005];
int find(int x){
    if(x==f[x])return x;
    else return f[x]=find(f[x]);
}
void solve(){
    int n,q;
    cin>>n>>q;
    vector<int>nes(n+1),cor(n+1),pos(n+1);
    
    for(int i=1;i<=n;i++){
        nes[i]=i;
        cor[i]=i;
        pos[i]=i;
    }
    while(q--){
        int mode;
        cin>>mode;
        if(mode==1){
            int a,b;
            cin>>a>>b;
            pos[a]=nes[b];


        }else if(mode==2){
            int a,b;
            cin>>a>>b;
            cor[nes[a]]=b;
            cor[nes[b]]=a;
            swap(nes[a],nes[b]);

        }else if(mode==3){
            int a;
            cin>>a;
            cout<<cor[pos[a]]<<endl;
        }
        /*cout<<"nes : "; 
        for(int i=1;i<=n;i++){
            cout<<nes[i]<<" ";
        }cout<<endl;
        cout<<"cor : "; 
        for(int i=1;i<=n;i++){
            cout<<cor[i]<<" ";
        }cout<<endl;
        cout<<"pos : "; 
        for(int i=1;i<=n;i++){
            cout<<pos[i]<<" ";
        }cout<<endl;*/
    }

}
signed main(){
    //注意多筆測資輸入！！！
    Mikari_My_Wife
    int t=1;
    //cin>>t;
    while(t--){solve();}
}

提出情報

ジャッジ結果