Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int N[1000100], M[1000010];
- int main(){
- int n, m, p; scanf("%d %d %d", &n, &m, &p);
- for(int i = 1; i <= n; i++) N[i] = i;
- for(int i = 1; i <= m; i++) M[i] = i;
- while(p--){
- char o; int a, b; scanf(" %c %d %d", &o, &a, &b);
- if(o == 'L'){
- swap(N[a], N[b]);
- }
- else{
- swap(M[a], M[b]);
- }
- }
- for(int i = 1; i <= n; i++){
- for(int j = 1; j <= m; j++){
- printf("%d ", (N[i]-1)*m+M[j]);
- }
- printf("\n");
- }
- }
Advertisement