Submission #63283478

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main() {
    int n,q;
    cin>>n>>q;
    vector<int>pos(n+1);
    vector<unordered_set<int> >nest(n+1);
    for(int i=1;i<=n;i++){
        pos[i]=i;
        nest[i].insert(i);
    }
    while(q--){
        int t;
        cin>>t;
        if(t==1){
            int a,b;
            cin>>a>>b;
            nest[pos[a]].erase(a);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;

int main() {
    int n,q;
    cin>>n>>q;
    vector<int>pos(n+1);
    vector<unordered_set<int> >nest(n+1);
    for(int i=1;i<=n;i++){
        pos[i]=i;
        nest[i].insert(i);
    }
    while(q--){
        int t;
        cin>>t;
        if(t==1){
            int a,b;
            cin>>a>>b;
            nest[pos[a]].erase(a);
            nest[b].insert(a);
            pos[a]=b;
        }
		else if(t==2){
            int a,b;
            cin>>a>>b;
            swap(nest[a],nest[b]);
            for(int p:nest[a]){
                pos[p]=a;
            }
            for(int p:nest[b]){
                pos[p]=b;
            }
        }
		else if(t==3){
            int a;
            cin>>a;
            cout<<pos[a]<<endl;
        }
    }
    return 0;
}

Submission Info

Judge Result