Hdu 5319 Painter (模拟)

直接贪心去模拟就完，最坑的是那不是n*n的矩阵，m没告诉你，自己求。

[code]:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>

using namespace std;

int n,m,a[55][55];
char s[55][55];
int dx[4] = {0,1,1,1};
int dy[4] = {0,1,-1,1};

void sol(){
    int i,j,k,ans = 0;
    int nx,ny,color;
    for(i = 0;i < n;i++)
    for(j = 0;j < m;j++){
        while(a[i][j]){
            k = a[i][j];color = k==3?1:k;
            nx = i;ny = j;
            while(nx>=0&&nx<n&&ny>=0&&ny<m){
                if(a[nx][ny]!=color&&a[nx][ny]!=3) break;
                a[nx][ny] -= color;
                nx = nx+dx[k],ny = ny+dy[k];
            }
            ans++;
        }
    }
    printf("%d\n",ans);
}

int main(){
    int i,j,cas,l,r;
    scanf("%d",&cas);
    while(cas--){
        scanf("%d",&n);
        for(i = 0;i < n;i++) scanf("%s",s[i]);
        m = strlen(s[0]);
        for(i = 0;i < n;i++){
            for(j = 0; j < m;j++){
                if(s[i][j]=='R') a[i][j] = 1;
                else if(s[i][j]=='B') a[i][j] = 2;
                else if(s[i][j]=='G')a[i][j] = 3;
                else a[i][j] = 0;
            }
        }
        sol();
    }

    return 0;
}