题解 | #矩阵交换#

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    int a[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }

    int time;
    cin >> time;
    char t;
    int x, y;
    for (int i = 0; i < time; i++) {
        cin >> t >> x >> y;

        if (t == 'r') {
            for (int o = 0; o < m; o++) {
                int num = a[x - 1][o];
                a[x - 1][o] = a[y - 1][o];
                a[y - 1][o] = num;
            }
        }

        if (t == 'c') {
            for (int o = 0; o < n; o++) {
                int num = a[o][x - 1];
                a[o][x - 1] = a[o][y - 1];
                a[o][y - 1] = num;
            }
        }
    }

    // 输出矩阵
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << a[i][j] << " ";
        }
        cout << endl;
    }

    return 0;
}