1128 N Queens Puzzle (20point(s))
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 (Q1,Q2,⋯,QN), where Qi 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.
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 Q1 Q2 … QN”, where 4≤N≤1000 and it is guaranteed that 1≤Qi≤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
题目大意:
输入 K 组数据,每组数据表示一张皇后图,每组数据有 N 个数字,每个数字表示该列皇后所在的行数
判断皇后图是否不能互相攻击,相当于判断任两个皇后不在同行、同列、同对角线
设计思路:
- 判断是否在同行、同列
- 判断是否在同对角线:两个点的横坐标之差是否等于纵坐标之差
编译器:C (gcc)
#include <stdio.h>
#include <stdlib.h>
int judge(int *a, int n)
{
int i, j;
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++)
if (a[i] == a[j] || abs(j - i) == abs(a[j] - a[i]))
return 0;
return 1;
}
int main(void)
{
int k, n, a[1010];
int i;
scanf("%d", &k);
while (k--) {
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
printf("%s\n", judge(a, n) ? "YES" : "NO");
}
return 0;
}