1128 N Queens Puzzle

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;
int n,row;

int main(){
    scanf("%d",&n);
    for(int k=1;k<=n;k++){
        scanf("%d",&row);
        int a[10000]={0},b[10000]={0},c[10000]={0},f=1,i=0;
        for(int j=1;j<=row;j++){
            scanf("%d",&i);
            if(!f)continue;
            if(!a[i])a[i]=1;
            else f=0;
            if(!b[row+j-i])b[row+j-i]=1;
            else f=0;
            if(!c[j+i])c[j+i]=1;
            else f=0;
        }
        if(f)printf("YES\n");
        else printf("NO\n");
    }
    
    return 0;
}


法二：
#include <bits/stdc++.h>
using namespace std;
int n,m;
int main(){
    //std::ios::sync_with_stdio(false);
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&m);
        int tp[1050];
        set<int>iset;
        memset(tp, 0, 1050);
        bool flag=true;
        for(int j=1;j<=m;j++){
            scanf("%d",&tp[j]);
            if(iset.find(tp[j])!=iset.end())flag=false;
            iset.insert(tp[j]);
        }
        if(!flag){printf("NO\n");continue;}
        for(int j=1;j<=m;j++){
            for(int k=1;k+j<=m;k++)
                if(tp[j]+k==tp[j+k]){flag=false;printf("NO\n");break;}
            if(!flag)break;
        }
        if(!flag)continue;
        for(int j=1;j<=m;j++){
            for(int k=1;k+j<=m;k++)
                if(tp[j]-k==tp[j+k]){flag=false;printf("NO\n");break;}
            if(!flag)break;
        }
        if(!flag)continue;
        printf("YES\n");
    }
    return 0;
}