每日一题第四十期 Codeforces Round 928 (Div. 4)

最新推荐文章于 2024-09-13 16:27:15 发布

娇娇yyyyyy

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量934

点赞数 31

分类专栏：每日一题文章标签：算法

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

版权

每日一题专栏收录该内容

97 篇文章 1 订阅

订阅专栏

程序解决了一个问题，需判断给定二进制网格中是否存在构成三角形或正方形的1的模式，通过计算行内连续1的数量来确定。

摘要由CSDN通过智能技术生成

B. Vlad and Shapes

time limit per test: 1 second

memory limit per test: 256 megabytes

input: standard input

output: standard output

Vladislav has a binary square grid of $\times n$ cells. A triangle or a square is drawn on the grid with symbols $\texttt{1}$ . As he is too busy being cool, he asks you to tell him which shape is drawn on the grid.

A triangle is a shape consisting of $k$ ( $KaTeX parse error: Expected 'EOF', got '&' at position 2: k&̲gt;1$ ) consecutive rows, where the $i$ -th row has $\cdot i-1$ consecutive characters $\texttt{1}$ , and the central 1s are located in one column. An upside down triangle is also considered a valid triangle (but not rotated by 90 degrees).

Two left pictures contain examples of triangles: $k = 4$ , $k = 3$ . The two right pictures don’t contain triangles.

A square is a shape consisting of $k$ ( $KaTeX parse error: Expected 'EOF', got '&' at position 2: k&̲gt;1$ ) consecutive rows, where the $i$ -th row has $k$ consecutive characters $\texttt{1}$ , which are positioned at an equal distance from the left edge of the grid.

Examples of two squares: $k = 2$ , $k = 4$ .

For the given grid, determine the type of shape that is drawn on it.

Input

The first line contains a single integer $t$ ( $\leq t \leq 100$ ) — the number of test cases.

The first line of each test case contains a single integer $n$ ( $\leq n \leq 10$ ) — the size of the grid.

The next $n$ lines each contain $n$ characters $\texttt{0}$ or $\texttt{1}$ .

The grid contains exactly one triangle or exactly one square that contains all the $\texttt{1}$ s in the grid. It is guaranteed that the size of the triangle or square is greater than $1$ (i.e., the shape cannot consist of exactly one 1).

Output

For each test case, output “SQUARE” if all the $\texttt{1}$ s in the grid form a square, and “TRIANGLE” otherwise (without quotes).

Example
inputCopy
6
3
000
011
011
4
0000
0000
0100
1110
2
11
11
5
00111
00010
00000
00000
00000
10
0000000000
0000000000
0000000000
0000000000
0000000000
1111111110
0111111100
0011111000
0001110000
0000100000
3
111
111
111
outputCopy
SQUARE
TRIANGLE
SQUARE
TRIANGLE
TRIANGLE
SQUARE

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
//#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
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 t;
int n;
string a[100];
int main()
{
	cin >> t;
	while(t --){
		int f = 0, flag = 0;
		cin >> n;
		for(int i = 1; i <= n; i ++)
		{
			for(int j = 1; j <= n; j ++)
			{
				cin >> a[i][j];
			}
		}
		for(int i = 1; i <= n; i ++)
		{
			int cnt = 0;
			for(int j = 1; j <= n; j ++)
			{
				if(a[i][j] == '1') cnt ++;
			}
			if(flag != 0 && cnt != flag  && cnt != 0) f = 1;
			flag = cnt;
		}
		if(f) cout << "TRIANGLE" << endl;
		else cout << "SQUARE" << endl;
		
	}
	return 0;
}