UVA1103

这道题目刘汝佳的方式非常的巧妙

他将每一个区域，都涂成了一种颜色，然后只需要判断边界处的颜色有多少种就可以了

// UVa1103 Ancient Messages
// Rujia Liu
// we pad one empty line/column to the top/bottom/left/right border, so color 1 is always "background" white
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<time.h>
#include<set>
using namespace std;

char bin[256][5];

const int maxh = 200 + 5;
const int maxw = 50 * 4 + 5;

int H, W, pic[maxh][maxw], color[maxh][maxw];
char line[maxw];

//涂色
void decode(char ch, int row, int col) {
  for(int i = 0; i < 4; i++)
    pic[row][col+i] = bin[ch][i] - '0';
}

const int dr[] = {-1, 1, 0, 0};
const int dc[] = {0, 0, -1, 1};

// dfs from (row, col) and paint color c
void dfs(int row, int col, int c) {
  color[row][col] = c;
  for(int i = 0; i < 4; i++) {
    int row2 = row + dr[i];
    int col2 = col + dc[i];
    if(row2 >= 0 && row2 < H && col2 >= 0 && col2 < W && pic[row2][col2] == pic[row][col] && color[row2][col2] == 0)
      dfs(row2, col2, c);
  }
}

vector<set<int> > neighbors;

void check_neighbors(int row, int col) {
  for(int i = 0; i < 4; i++) {
    int row2 = row + dr[i];
    int col2 = col + dc[i];
    if(row2 >= 0 && row2 < H && col2 >= 0&& col2 < W && pic[row2][col2] == 0 && color[row2][col2] != 1)
      neighbors[color[row][col]].insert(color[row2][col2]);
  }
}

const char* code = "WAKJSD";

char recognize(int c) {
  int cnt = neighbors[c].size();
  return code[cnt];
}

// use this function to print the decoded picture
void print() {
  for(int i = 0; i < H; i++) {
    for(int j = 0; j < W; j++) printf("%d", pic[i][j]);
    printf("\n");
  }
}

int main() {
freopen("input.txt","r",stdin);
  strcpy(bin['0'], "0000");
  strcpy(bin['1'], "0001");
  strcpy(bin['2'], "0010");
  strcpy(bin['3'], "0011");
  strcpy(bin['4'], "0100");
  strcpy(bin['5'], "0101");
  strcpy(bin['6'], "0110");
  strcpy(bin['7'], "0111");
  strcpy(bin['8'], "1000");
  strcpy(bin['9'], "1001");
  strcpy(bin['a'], "1010");
  strcpy(bin['b'], "1011");
  strcpy(bin['c'], "1100");
  strcpy(bin['d'], "1101");
  strcpy(bin['e'], "1110");
  strcpy(bin['f'], "1111");

  int kase = 0;
  while(scanf("%d%d", &H, &W) == 2 && H) {
    memset(pic, 0, sizeof(pic));
    for(int i = 0; i < H; i++) {
      scanf("%s", line);
      for(int j = 0; j < W; j++)
        decode(line[j], i+1, j*4+1);//从什么地方开始涂颜色
    }
    H += 2;
    W = W * 4 + 2;
    //上面的代码涂色完毕，而且是从1，1开始涂得
    int cnt = 0;
    vector<int> cc; // connected components of 1
    memset(color, 0, sizeof(color));
    //这个dfs执行完毕后，背景是1，其它的部分分别是不同的数字，就像冯宇老师的图一样，不同的成分不同的颜色
    for(int i = 0; i < H; i++)
      for(int j = 0; j < W; j++)
        if(!color[i][j]) {
          dfs(i, j, ++cnt);
          if(pic[i][j] == 1) cc.push_back(cnt);//里面装着所有的边界序号，即数字的序号
        }

    neighbors.clear();
    neighbors.resize(cnt+1);//将vector扩大为cnt+1，使得所有的序号都可以在这里面找到
    //这一个循环完毕之后，在边界对应的序号的集合中，装着的是其包围的所有空白的编号
    for(int i = 0; i < H; i++)
      for(int j = 0; j < W; j++)
        if(pic[i][j] == 1)
          check_neighbors(i, j);

    vector<char> ans;
    for(int i = 0; i < cc.size(); i++)
      ans.push_back(recognize(cc[i]));
    sort(ans.begin(), ans.end());

    printf("Case %d: ", ++kase);
    for(int i = 0; i < ans.size(); i++) printf("%c", ans[i]);
    printf("\n");
    printf("%.6f",(double)clock()/CLOCKS_PER_SEC);
  }
  return 0;
}

 

转载于:https://www.cnblogs.com/TorettoRui/p/10438491.html