hihoCoder#1094 Lost in the City

原题地址

限时10s，所以不用考虑什么算法了，暴力吧

分别按照3x3视野的四个方向去地图上匹配，把符合的地点标记出来，最后统一按照从上到下，从左到右的顺序输出。

代码：

#include <iostream>

using namespace std;

#define MAP_SIZE 250

bool match(char map[MAP_SIZE][MAP_SIZE], char sight[3][3], int r, int c) {
  for (int i = 0; i < 3; i++)
    for (int j = 0; j < 3; j++)
      if (map[r + i][c + j] != sight[i][j])
        return false;
  return true;
}

void find(char map[MAP_SIZE][MAP_SIZE], char sight[3][3], char res[MAP_SIZE][MAP_SIZE], int N, int M) {
  for (int i = 0; i < N - 2; i++) {
    for (int j = 0; j < M - 2; j++) {
      if (match(map, sight, i, j))
        res[i + 1][j + 1] = 1;
    }
  }
}

void rotate(char sight[3][3]) {
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 2; j++)
      swap(sight[i][j], sight[2 - j][2 - i]);
  for (int i = 0; i < 3; i++)
    swap(sight[0][i], sight[2][i]);
}

int main() {
  int N, M;
  char map[MAP_SIZE][MAP_SIZE];
  char res[MAP_SIZE][MAP_SIZE];
  char sight[3][3];

  cin >> N >> M;
  for (int i = 0; i < N; i++)
    for (int j = 0; j < M; j++)
      cin >> map[i][j];

  for (int i = 0; i < 3; i++)
    for (int j = 0; j < 3; j++)
      cin >> sight[i][j];

  memset(res, 0, MAP_SIZE * MAP_SIZE * sizeof(char));

  for (int i = 0; i < 4; i++) {
    find(map, sight, res, N, M);
    rotate(sight);
  }

  for (int i = 1; i < N - 1; i++)
    for (int j = 1; j < M - 1; j++)
      if (res[i][j])
        cout << i + 1 << " " << j + 1 << endl;

  return 0;
}