Squares UVa201

最新推荐文章于 2021-10-30 16:14:15 发布

跃迁引擎启动-

最新推荐文章于 2021-10-30 16:14:15 发布

阅读量257

点赞数

分类专栏：算法竞赛入门经典文章标签： ACM

本文链接：https://blog.csdn.net/yjl9903/article/details/79307018

版权

算法竞赛入门经典专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Time： 45mins.

#include <iostream>
#include <cstring>
using namespace std;
int h[20][20] = { 0 }, v[20][20] = { 0 }, res[20] = { 0 };
int main()
{
    int kase = 0, size, T;
    while (cin >> size >> T)
    {
        memset(h, 0, sizeof h);
        memset(v, 0, sizeof v);
        memset(res, 0, sizeof res);
        while (T--)
        {
            char s;
            int x, y;
            cin >> s >> x >> y;
            if (s == 'H')
                h[x][y] = 1;
            else
                v[y][x] = 1;
        }
        int flag = 1;//标记是否完全无解
        for (int s = 1; s <= size; s++)
        {
            int cnt = 0;
            for (int i = 1; i <= size - s; i++)
                for (int j = 1; j <= size - s; j++)
                {
                    int mark = 1;//标记是否缺少边
                    for (int x = j; x <= j + s - 1; x++)
                        if (!h[i][x] || !h[i + s][x])
                            mark = 0;

                    for (int x = i; x <= i + s - 1; x++)
                        if (!v[x][j] || !v[x][j + s])
                            mark = 0;
                    if (mark)
                        cnt++;
                }
            res[s] = cnt;
            if (cnt)
                flag = 0;
        }
        if(kase)
            cout << endl << "**********************************" << endl << endl;
        cout << "Problem #" << ++kase << endl << endl;
        if (flag)
            cout << "No completed squares can be found." << endl;
        for (int i = 1; i <= size; i++)
            if (res[i])
                cout << res[i] << " square (s) of size " << i << endl;
    }
    return 0;
}