每日一题第八十五期 Codeforces Round 938 (Div. 3)

最新推荐文章于 2024-10-09 22:28:58 发布

娇娇yyyyyy

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量1.1k

点赞数 12

分类专栏：每日一题 cf 文章标签：算法数据结构

本文链接：https://blog.csdn.net/2301_80882026/article/details/137565021

版权

每日一题同时被 2 个专栏收录

97 篇文章 1 订阅

订阅专栏

30 篇文章 0 订阅

订阅专栏

B. Progressive Square

time limit per test: 2 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

A progressive square of size $n$ is an $\times n$ matrix. Maxim chooses three integers $a_{1,1}$ , $c$ , and $d$ and constructs a progressive square according to the following rules:

$a_{i+1,j} = a_{i,j} + c$

$a_{i,j+1} = a_{i,j} + d$

For example, if $n = 3$ , $a_{1,1} = 1$ , $c = 2$ , and $d = 3$ , then the progressive square looks as follows:

$\begin{pmatrix} 1 & 4 & 7 \\ 3 & 6 & 9 \\ 5 & 8 & 11 \end{pmatrix}$

Last month Maxim constructed a progressive square and remembered the values of $n$ , $c$ , and $d$ . Recently, he found an array $b$ of $n^2$ integers in random order and wants to make sure that these elements are the elements of that specific square.

It can be shown that for any values of $n$ , $a_{1,1}$ , $c$ , and $d$ , there exists exactly one progressive square that satisfies all the rules.

Input

The first line contains an integer $t$ ( $\le t \le {10} ^ 4$ ) — the number of test cases.

The first line of each test case contains three integers $n$ , $c$ , and $d$ ( $\le n \le 500$ , $\le c, d \le 10^6$ ) — the size of the square and the values of $c$ and $d$ as described in the statement.

The second line of each test case contains $\cdot n$ integers $b_1, b_2, \dots, b_{n \cdot n}$ ( $\le b_i \le 10^9$ ) — the elements found by Maxim.

It is guaranteed that the sum of $n ^ 2$ over all test cases does not exceed $25 \cdot {10} ^ 4$ .

Output

For each test case, output “YES” in a separate line if a progressive square for the given $n$ , $c$ , and $d$ can be constructed from the array elements $a$ , otherwise output “NO”.

You can output each letter in any case (lowercase or uppercase). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be accepted as a positive answer.
Example
inputCopy
5
3 2 3
3 9 6 5 7 1 10 4 8
3 2 3
3 9 6 5 7 1 11 4 8
2 100 100
400 300 400 500
3 2 3
3 9 6 6 5 1 11 4 8
4 4 4
15 27 7 19 23 23 11 15 7 3 19 23 11 15 11 15
outputCopy
NO
YES
YES
NO
NO

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<iomanip>
#define endl '\n'
using namespace std;
 
typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=1e9 + 7;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;
 
int n, c, d;
 
int t;
int a[N], b[N];
int main()
{
	
    cin >> t;
	while(t --){
		int flag = 0;
	    cin >> n >> c >> d;// c列d行
		for(int i = 1; i <= n * n; i ++)
		{
			cin >> a[i];
		}
		sort(a + 1, a + 1 + n * n);
		b[1] = a[1];
		int f = b[1], k = 1;
		for(int i = 2; i <= n; i ++)//
		{
			b[++ k] = f + c;
			f = f + c;
		}//共n列
		for(int i = 1; i <= n; i ++)
		{
			f = b[i];
			for(int j = 2; j <= n; j ++)
			{
				b[++ k] = f + d;
				f = f + d;
			}
		}
		sort(b + 1, b + 1 + n * n);
		for(int i = 1; i <= n * n; i ++)
		{
			if(a[i] != b[i]) flag = 1;
		}
		if(flag) puts("NO");
		else puts("YES");
	}
	return 0;
}