PTA甲级 1128 N Queens Puzzle (C++)

The “eight queens puzzle” is the problem of placing eight chess queens on an $8\times 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\times N$ chessboard. (From Wikipedia - “Eight queens puzzle”.)

Input Specification:

Each input file contains several test cases. The first line gives an integer $K(1<K\le 200)$. Then $K$ lines follow, each gives a configuration in the format "$N$ $Q_1$ $Q_2$ … $Q_N$", where $4\le N\le 1000$ and it is guaranteed that $1\le Q_i\le N$ for all $i=1,\cdots ,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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-28 17:19:19
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int cases[1010];

bool isSolution(int n){
    unordered_map<int, bool> rows, diag, rdiag;

    for(int i = 1; i <= n; ++i){
        if(rows[cases[i]] == true || diag[i + cases[i]] == true || rdiag[i + n + 1 - cases[i]] == true) return false;

        rows[cases[i]] = true;
        diag[i + cases[i]] = true;
        rdiag[i + n + 1 - cases[i]] = true;
    }

    return true;
}

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

    for(int i = 0; i < k; ++i){
        int num;
        scanf("%d", &num);

        for(int j = 1; j <= num; ++j) scanf("%d", &cases[j]);
        if(isSolution(num)) printf("YES\n");
        else printf("NO\n");
    }

    return 0;
}