AtCoder ABC 355 C（详细题解及AC代码）

最新推荐文章于 2024-07-13 13:36:16 发布

King童年回忆

最新推荐文章于 2024-07-13 13:36:16 发布

阅读量679

点赞数 7

文章标签：算法

本文链接：https://blog.csdn.net/2301_76723927/article/details/139213017

版权

Problem Statement

There is an $NN$ grid, where the cell at the i-th row from the top and the j-th column from the left contains the integer $N(i-1)+j$

Over $T$ turns, integers will be announced. On Turn $i$ the integer $Ai$ is announced, and the cell containing $Ai$ is marked. Determine the turn on which Bingo is achieved for the first time. If Bingo is not achieved within T turns, print .

Here, achieving Bingo means satisfying at least one of the following conditions:

There exists a row in which all $N$ cells are marked.
There exists a column in which all $N$ cells are marked.
There exists a diagonal line (from top-left to bottom-right or from top-right to bottom-left) in which all $N$ cells are marked.

思路

我们可以设两个数组与两个变量，来分别累加打过标记的 $A[i,j]$ ,其实公式 $N*(i-1)+j$ 的本质就是二维转一维，所以不用初始赋值。

假设用 $row$ 代表行上的累加和，用 $column$ 代表列上的累加和，用 $d1$ 代表主对角线，用 $d2$ 代表副对角线，只要四个当中有一个为 $N$ ，则就 $Bingo$ 。

代码

$Cpp$

//https://atcoder.jp/users/XUZIBO
#include <bits/stdc++.h>
using namespace std;
int n,t;
int row[2005],column[2005];
int d1,d2;
bool judge(){
	for(int i=1;i<=n;i++){
		if(row[i]==n||column[i]==n){
			return true;
		}
	}
	if(d1==n||d2==n){
		return true;
	}
	return false;
}
int main(){
	cin>>n;
	cin>>t;
	int pos;
	int i=1;
	while(i<=t){
		cin>>pos;
		int x,y;
		x=(pos-1)/n+1;
		y=(pos-1)%n+1;
		row[x]++;
		column[y]++;
		if(x==y){
			d1++;
		}
		if(x+y==n+1){
			d2++;
		}
		if(judge()){
			cout<<i;
			return 0;
		}
		i++;
	}
	cout<<"-1";
	return 0;
}