1128 N Queens Puzzle (20分)

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​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

思路：用哈希判断是否行重复（题目暗示不会在同一列），如果没有行重复，再和前面的逐一比较有没有在同一条对角线上，应该是接近最优的一种写法了。

#include<bits/stdc++.h>
using namespace std;
struct node{
    int x, y;
    node(int a, int b):x(a), y(b){}
};
vector<node> ve;
unordered_map<int, int> row;
int main(){
    int n, m, r;
    scanf("%d", &n);
    for(int i=0; i<n; ++i){
        bool f=1;
        scanf("%d", &m);
        for(int j=1; j<=m; ++j){
            scanf("%d", &r);
            if(row.count(r)==1) f=0;
            else row[r]=1;
            int len = ve.size();
            if(f){
                for(int k=0; k<len; ++k){
                    int xx = abs(ve[k].x - r);
                    int yy = abs(j - ve[k].y);
                    if(xx==yy){
                        f=0;
                        break;
                    }
                }
            }
            ve.push_back(node(r, j));
        }
        if(f) puts("YES");
        else puts("NO");
        row.clear();
        ve.clear();
    }
    return 0;
}