原题链接:
解题思路:
采用枚举、深度优先搜索的方法。
- 枚举每一个可能的起点进行深度优先搜索;
- 枚举每一个可能放置障碍的位置,然后进行步骤1。
通过画面:
代码:
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <string>
using namespace std;
enum direction { UP, DOWN, LEFT, RIGHT };
struct position {
int x, y;
position(int x = 0, int y = 0) : x(x), y(y) {}
};
void dfs(char field[20][20], direction dir, position start, int left);
int minLeft, cnt;
const direction arr[4] = { UP, DOWN, LEFT, RIGHT };
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, -1, 1 };
bool flag = true;
int main()
{
int n, k;
assert(2 == scanf("%d %d", &n, &k));
minLeft = 400, cnt = 0;
char field[20][20];
for (int i = 1; i <= n; i++) {
field[1][i] = '#';
field[n][i] = '#';
field[i][1] = '#';
field[i][n] = '#';
}
for (int i = 2; i < n; i++) {
for (int j = 2; j < n; j++) {
field[i][j] = '.';
}
}
for (int i = 0; i < k; i++) {
position p;
assert(2 == scanf("%d %d", &p.x, &p.y));
field[p.x][p.y] = '@';
}
for (int i = 2; i < n; i++) {
for (int j = 2; j < n; j++) {
if (field[i][j] != '@') {
field[i][j] = '*';
flag = true;
for (int k2 = 0; k2 < 4; k2++) {
dfs(field, arr[k2], position(i, j), (n - 2)*(n - 2) - k - 1);
}
field[i][j] = '.';
}
}
}
printf("%d %d\n", minLeft, cnt);
int oldMinLeft = minLeft, oldCnt = cnt;
int improveCnt = 0, improveLeft = minLeft;
for (int i = 2; i < n; i++) {
for (int j = 2; j < n; j++) {
if (field[i][j] != '@') {
field[i][j] = '@';
minLeft = 400;
cnt = 0;
for (int k2 = 2; k2 < n; k2++) {
for (int k3 = 2; k3 < n; k3++) {
if (field[k2][k3] != '@') {
flag = true;
field[k2][k3] = '*';
for (int k4 = 0; k4 < 4; k4++) {
dfs(field, arr[k4], position(k2, k3), (n - 2)*(n - 2) - k - 2);
}
field[k2][k3] = '.';
}
}
}
if (minLeft < improveLeft && minLeft < oldMinLeft) {
improveLeft = minLeft;
improveCnt = 1;
}
else if (minLeft == improveLeft && minLeft < oldMinLeft) {
improveCnt++;
}
field[i][j] = '.';
}
}
}
if (improveCnt) {
printf("%d %d\n", improveLeft, improveCnt);
}
else {
printf("-1\n");
}
return 0;
}
void dfs(char field[20][20], direction dir, position start, int left)
{
if (field[start.x + dx[dir]][start.y + dy[dir]] == '.') {
int startX = start.x, startY = start.y;
while (field[startX + dx[dir]][startY + dy[dir]] == '.') {
startX = startX + dx[dir];
startY = startY + dy[dir];
field[startX][startY] = '*';
left--;
}
if (left < minLeft) {
flag = false;
minLeft = left;
cnt = 1;
}
else if (left == minLeft && flag) {
flag = false;
cnt++;
}
for (int i = 0; i < 4; i++) {
dfs(field, arr[i], position(startX, startY), left);
}
for (; startX != start.x || startY != start.y; startX -= dx[dir], startY -= dy[dir]) {
field[startX][startY] = '.';
left++;
}
}
return;
}