UVA_10443_Rock

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
char arr[110][110];

void simulate(int r,int c){
  char arr1[110][110];
  for(int i=0;i<r;i++){
    for(int j=0;j<c;j++){
        arr1[i][j]=arr[i][j];
    }
  }
   for(int i=0;i<r;i++){
    for(int j=0;j<c;j++){
        if(arr[i][j]=='R'){
            if(i-1>=0) if(arr[i-1][j]=='P'){arr1[i][j]='P';}
            if(i+1<r) if(arr[i+1][j]=='P'){arr1[i][j]='P';}
            if(j-1>=0) if(arr[i][j-1]=='P'){arr1[i][j]='P';}
            if(j+1<c) if(arr[i][j+1]=='P'){arr1[i][j]='P';}
        }else if(arr[i][j]=='S'){
            if(i-1>=0) if(arr[i-1][j]=='R'){arr1[i][j]='R';}
            if(i+1<r) if(arr[i+1][j]=='R'){arr1[i][j]='R';}
            if(j-1>=0) if(arr[i][j-1]=='R'){arr1[i][j]='R';}
            if(j+1<c) if(arr[i][j+1]=='R'){arr1[i][j]='R';}
        }else if(arr[i][j]=='P'){
            if(i-1>=0) if(arr[i-1][j]=='S'){arr1[i][j]='S';}
            if(i+1<r) if(arr[i+1][j]=='S'){arr1[i][j]='S';}
            if(j-1>=0) if(arr[i][j-1]=='S'){arr1[i][j]='S';}
            if(j+1<c) if(arr[i][j+1]=='S'){arr1[i][j]='S';}
        }
    }
   }
   /*final del dia*/
   for(int i=0;i<r;i++){
    for(int j=0;j<c;j++){
        arr[i][j]=arr1[i][j];
    }
  }
}
int main() {
    int t;
    scanf("%d",&t);int r,c,n;
    while(t--){
        scanf("%d %d %d",&r,&c,&n);
        memset(arr,'0',sizeof(arr));getchar();
        for(int i=0;i<r;i++){
            gets(arr[i]);
        }
        for(int i=0;i<n;i++){
        simulate(r,c);
        }
        for(int i=0;i<r;i++){
            printf("%s\n",arr[i]);
        }
        if(t>0) printf("\n");
    }
    return 0;
}