PAT (Advanced Level) Practise 1128 N Queens Puzzle (20)
来源:互联网 发布:淘宝内部券是真的吗 编辑:程序博客网 时间:2024/06/07 01:01
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 (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:48 4 6 8 2 7 1 3 59 4 6 7 2 8 1 9 5 36 1 5 2 6 4 35 1 3 5 2 4Sample Output:
YESNONOYES
解题思路:记录下每行出现的次数,然后判断是不是在同一斜线上
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int n, x[1005], visit[1005];int main(){int t;scanf("%d", &t);while (t--){scanf("%d", &n);memset(visit, 0, sizeof visit);int flag = 1;for (int i = 1; i <= n; i++){scanf("%d", &x[i]);if (visit[x[i]]) flag = 0;visit[x[i]] = 1;}if (!flag) { printf("NO\n"); continue; }for (int i = 2; i <= n; i++)for (int j = 1; j < i; j++)if (abs(i - j) == abs(x[i] -x[j])) { flag = 0; break; }if (flag) printf("YES\n");else printf("NO\n");}return 0;}
- PAT (Advanced Level) Practise 1128 N Queens Puzzle (20)
- PAT (Advanced Level) Practise 1128 N Queens Puzzle (20)
- 【PAT】【Advanced Level】1128. N Queens Puzzle (20)
- pat 1128N Queens Puzzle
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1008. Elevator (20)
- PAT (Advanced Level) Practise 1008 Elevator (20)
- PAT (Advanced Level) Practise 1035 Password (20)
- PAT (Advanced Level) Practise 1061 Dating (20)
- vuejs组件开发之手风琴菜单组件实例
- 携程-出行产品未来14个月销量预测-第七名代码解读
- Servlet之三(Request,cookie,session)
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 深度学习之GoogLeNet解读
- PAT (Advanced Level) Practise 1128 N Queens Puzzle (20)
- 一代代码“撸清”内部类与外部类的访问权限关系
- 新单点登录SSO
- leetcode 389. Find the Difference
- 122. Best Time to Buy and Sell Stock II -- greedy
- 2017-5-15 C++ primer 笔记
- CodeForces 805B3-palindrome
- 求职,离职,入职
- checkBox全选及提交JS