实在想不出优化方法了

#include<bits/stdc++.h>

using namespace std;
int a[1000005];
bool cmp(int a, int b) {
	return a > b;
}
inline int read() {
	int x = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		x = x * 10 + (c - '0');
		c = getchar();
	}
	return x * f;
}
inline void write(int x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9) write(x/10);
	putchar(x%10+'0');
}
int main() {
	int n, m;
	n = read();
	m = read();
	int tot = 0;
	for (int i = 1; i <= n; i++) {
		tot++;
		a[tot] = i;
	}
	while (m--) {
		int x;
		cin >> x;
		if (x == 1) {
			sort(a+1,a+n+1);
		}
		if (x == 2) {
			sort(a+1,a+n+1,cmp);
		}
		if (x == 3) {
			int p, q;
			cin >> p >> q;
			swap(a[p],a[q]);
		}
		if (x == 4) {
			for (int i = n; i >= n/2+1; i--) {
				swap(a[i],a[n-i+1]);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		write(a[i]);
		putchar(' ');
	}
	return 0;
}