Submission #63316188

---

Source Code Expand

#include<bits/stdc++.h>
 
using namespace std;
typedef long long ll;

int n, q;
std::vector<int> nestToIdx, lblToIdx, idxToLbl;
void solve(){
	cin >> n >> q;
	nestToIdx.resize(n+1);
	lblToIdx.resize(n+1);
	idxToLbl.resize(n+1);
	for(int i = 1; i <= n; i++){
		lblToIdx[i] = i;
		idxToLbl[i] = i;
		nestToIdx[i] = i;
	}
	for(int i = 0; i < q; i++){
		int type, a, b;
		cin >> type;
		if(type == 1){
			cin >> a >> b;
			nestToIdx[a] = lblToIdx[b];
		}
		else if(type == 2){
			cin >> a >> b;
			// idxToLbl[lblToIdx[a]] = b;
			// idxToLbl[lblToIdx[b]] = a;
			// swap(lblToIdx[a], lblToIdx[b]);
			 //5
			int lb1 = a;
			int lb2 = b;
			int idx1 = lblToIdx[lb1];
			int idx2 = lblToIdx[lb2];
			idxToLbl[idx1] = b;
			idxToLbl[idx2] = a;
			swap(lblToIdx[lb1], lblToIdx[lb2]);
			//set lb2's idx to idx1
			//set lb1's idx to idx2;
			//set idx1's lb to lb2
			//set idx2's lb to lb1

		}
		else{
			cin >> a;
		cout<< idxToLbl[nestToIdx[a]] << "\n";

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

Submission Info

Judge Result