1128 N Queens Puzzle（20 分）（C++）

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 Nnon-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​1​​,Q​2​​,⋯,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​1​​ Q​2​​ ... 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

刚开始拿到题，心想20分的题......出八皇后吗？然后定睛一看，噢~~~~只是让你判断时候满足所有点不在同一条线上（行、列、对角线），即是否满足八皇后的要求

解题思路：col记录哪些列已经有棋子，visitdia1记录主对角线，注意由于是行列号相减，可能出现负的情况，所以要加上一个cnt（棋盘的行数），visitdia2记录已经有棋子的副对角线。

#include <iostream>
#include <vector>
using namespace std;
int k, n, temp;
bool col[1005], dia1[2005], dia2[2005];
int main(){
	scanf("%d", &k);
	for(int i = 0; i < k; ++ i){
		scanf("%d", &n);
		bool flag = true;
		fill(col, col + n + 1, true);
		fill(dia1, dia1 + 2 * n + 1, true);
		fill(dia2, dia2 + 2 * n + 1, true);
		for(int j = 1; j <= n; ++ j){
			scanf("%d", &temp);
			flag &= (col[temp] & dia1[temp + j] & dia2[temp - j + n]);
			col[temp] = false; dia1[temp + j] = false; dia2[temp - j + n] = false;
		}
		printf("%s\n", flag == false ? "NO" : "YES");
	}
}