codeforces round928-B

最新推荐文章于 2024-08-16 23:08:36 发布

致碑前繁花

最新推荐文章于 2024-08-16 23:08:36 发布

阅读量603

点赞数 11

分类专栏：刷题记录文章标签： c++

本文链接：https://blog.csdn.net/2302_79440616/article/details/136180868

版权

刷题记录专栏收录该内容

182 篇文章 0 订阅

订阅专栏

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).

此题可以记录每一行的1的数量，因为正方形的每一行的1的数量都是一样的，而三角形的就不一样。

流加速千万不能写到循环里面，BYD写进去就错了，我刚刚才知道。

#include<iostream>
#include<cstring>
using namespace std;
const int N = 15;

char g[N][N];
int hang[N];
int n;
 
int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t; cin >> t;
    
    while (t--) {
        memset(hang,0,sizeof hang);
        
 
        cin >> n;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                cin >> g[i][j];
            }
        }
        bool flag= 0;
 
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                if(g[i][j] == '1'){
                    hang[i]++;
                }
            }
            if(hang[i] == hang[i-1] && hang[i] != 0){
                flag = 1;
                break;
            }
        }
 
        if (flag) {
            cout << "SQUARE" << endl;
        }
        else {
            cout << "TRIANGLE" << endl;
        }
    }
    return 0;
}