PAT(A) - 1128. N Queens Puzzle (20)

最新推荐文章于 2023-05-19 15:12:57 发布

这个好玩吗

最新推荐文章于 2023-05-19 15:12:57 发布

阅读量189

点赞数

分类专栏： ----杂题 PAT

本文链接：https://blog.csdn.net/flx413/article/details/79689908

版权

PAT 同时被 2 个专栏收录

91 篇文章 0 订阅

订阅专栏

----杂题

28 篇文章 0 订阅

订阅专栏

1128. N Queens Puzzle (20)

时间限制

300 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

The "eight queens puzzle" is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general N queens problem of placing N non-attacking queens on an N×N chessboard. (From Wikipedia - "Eight queens puzzle".)

Here you are NOT asked to solve the puzzles. Instead, you are supposed to judge whether or not a given configuration of the chessboard is a solution. To simplify the representation of a chessboard, let us assume that no two queens will be placed in the same column. Then a configuration can be represented by a simple integer sequence (Q₁, Q₂, ..., Q_N), where Q_i is the row number of the queen in the i-th column. For example, Figure 1 can be represented by (4, 6, 8, 2, 7, 1, 3, 5) and it is indeed a solution to the 8 queens puzzle; while Figure 2 can be represented by (4, 6, 7, 2, 8, 1, 9, 5, 3) and is NOT a 9 queens' solution.


Figure 1		Figure 2

Input Specification:

Each input file contains several test cases. The first line gives an integer K (1 < K <= 200). Then K lines follow, each gives a configuration in the format "N Q₁ Q₂ ... Q_N", where 4 <= N <= 1000 and it is guaranteed that 1 <= Q_i <= N for all i=1, ..., N. The numbers are separated by spaces.

Output Specification:

For each configuration, if it is a solution to the N queens problem, print "YES" in a line; or "NO" if not.

Sample Input:

4
8 4 6 8 2 7 1 3 5
9 4 6 7 2 8 1 9 5 3
6 1 5 2 6 4 3
5 1 3 5 2 4

Sample Output:

YES
NO
NO
YES

给一组序列，让你判断是否为N皇后的一个解。N皇后问题判断合法是有一个技巧是对角线有规律。用三个map做记录，一个用来判断行、一个用来判断主对角线、另一个判断负对角线。

#include <cstdio>
#include <map>

using namespace std;

int main() {
    int k, n, val;
    scanf( "%d", &k );

    while( k-- ) {
        map<int, int> mpA;  // 主对角线，行-列
        map<int, int> mpB;  // 负对角线，行+列
        map<int, int> mpR;  // 每一行
        bool flag = true;
        scanf( "%d", &n );
        for( int i = 1; i <= n; i++ ) {
            scanf( "%d", &val );
            if( !mpR.count( val ) && !mpA.count( val - i ) && !mpB.count( val + i ) ) {
                mpR[val] = 1;
                mpA[val - i] = 1;
                mpB[val + i] = 1;
            }
            else flag = false;
        }
        printf( "%s\n", flag ? "YES" : "NO" );
    }
    return 0;
}