RE求优化

#include<cstdio>
#include<iostream>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100][100];
struct change{
	int op,x,y;
};
change b[1000005];
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=m;i++){
		cin>>b[i].op>>b[i].x>>b[i].y;
	}
    for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(b[i].op==1){
				swap(a[b[i].x][j],a[b[i].y][j]);
			}
			if(b[i].op==0){
				swap(a[j][b[i].x],a[j][b[i].y]);
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cout<<a[i][j]<<' ';
		}
		cout<<endl;
	}
    return 0;
}