URAL 1970 皇后像廣場

来源：互联网发布：营销网络是什么编辑：程序博客网时间：2024/05/29 10:28

膜膜膜膜膜膜菊苣们

这个题直接暴搜就可以了，但是窝一开始漏了那个可以旋转的条件，然后就 WA

把旋转的条件搞上去之后发现T

然后看了菊苣们的代码才明白要一般搜一边判断合法性（其实大概也能想到，但是感觉不好写

还是菊苣写的厉害

贴代码：

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <string>#include <fstream>#include <list>#include <stack>#include <queue>#include <deque>#include <algorithm>#include <map>#include <set>#include <vector>using namespace std;int grid[10][4][4][4];bool used[10];pair<int, int> num[10];int ans[10][10];int xx[9] = { 0, 0, 0, 3, 3, 3, 6, 6, 6 };int yy[9] = { 0, 3, 6, 0, 3, 6, 0, 3, 6 };bool flag = false;void work(int pos){if (flag)return;if (pos >= 9){for (int i = 0; i < 10; ++i){for (int j = 0; j < 10; ++j){printf("%d", ans[i][j]);if (j == 9)printf("\n");elseprintf(" ");}}flag = true;return;}else{for (int i = 0; i < 9; ++i){if (used[i])continue;for (int j = 0; j < 4; ++j){bool f1 = true;for (int k = 0; k < 4; ++k){for (int l = 0; l < 4; ++l){if (ans[xx[pos] + k][yy[pos] + l] != -1 && ans[xx[pos] + k][yy[pos] + l] != grid[i][j][k][l]){f1 = false; break;}}}if (f1){for (int k = 0; k < 4; ++k){for (int l = 0; l < 4; ++l){ans[xx[pos] + k][yy[pos] + l] = grid[i][j][k][l];}}used[i] = true;work(pos + 1);if (flag)return;used[i] = false;for (int k = 0; k < 4; ++k){if (pos / 3 != 0 && k == 0)continue;for (int l = 0; l < 4; ++l){if (pos % 3 != 0 && l == 0)continue;ans[xx[pos] + k][yy[pos] + l] = -1;}}}}}}}int main(){//freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);memset(ans, -1, sizeof(ans));for (int i = 0; i < 9; ++i){for (int j = 0; j < 4; ++j){for (int k = 0; k < 4; ++k){scanf("%d", &grid[i][0][j][k]);}}}for (int i = 0; i < 9; ++i){for (int j = 0; j < 4; ++j){for (int k = 0; k < 4; ++k){grid[i][1][3 - k][j] = grid[i][0][j][k];}}}for (int i = 0; i < 9; ++i){for (int j = 0; j < 4; ++j){for (int k = 0; k < 4; ++k){grid[i][2][3 - j][3 - k] = grid[i][0][j][k];}}}for (int i = 0; i < 9; ++i){for (int j = 0; j < 4; ++j){for (int k = 0; k < 4; ++k){grid[i][3][k][3 - j] = grid[i][0][j][k];}}}work(0);//printf("finish\n");//while (1);return 0;}

0 0