CodeForces 1004D

题目链接

https://vjudge.net/problem/CodeForces-1004D

题意

标准的矩阵是只有一个0，0的四周都是1，1的四周都是2，2的四周都是3……

现在给t个数，问是否存在这样的矩阵，求矩阵的长宽和0所在的坐标。

思路

见官方题解

AC代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<string>
#include<sstream>
#include<cctype>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cstdlib>
#include<ctime>
#include<utility>
using namespace std;
typedef long long ll;
const double PI=atan(1.0)*4;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1000000007;
const int maxn = 1000010;

int cnt[maxn];  //输入数组中，各个元素出现次数
int c[maxn];    //算出n,m,a,b,x,y后，各元素出现次数

int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int t, n, m, x, y, a, b, z;
    bool isok = true;
    bool flag = false;
    scanf("%d", &t);
    for(int i = 0; i < t; i++)
    {
        scanf("%d", &z);
        cnt[z]++;
    }
    for(int i = 1; i < t; i++)
    {
        if(cnt[i] % 4 != 0)
        {
            x = i;
            break;
        }
    }
    for(int i = t; i >= 1; i--)
    {
        if(cnt[i] != 0)
        {
            b = i;
            break;
        }
    }

    for(n = x; n < t; n++)
    {
        if(t % n != 0)
            continue;
        m = t / n;
        y = n + m - b - x;
        if(y < 1 || y > m)
            continue;
        memset(c, 0, sizeof(c));

        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                int temp = fabs(x - i) + fabs(y - j);
                c[temp]++;
            }
        }

        isok = true;
        for(int i = 1; i < t; i++)
        {
            if(c[i] != cnt[i])
            {
                isok = false;
                break;
            }
        }
        if(isok)
        {
            flag = true;
            printf("%d %d\n%d %d\n", n, m, x, y);
            break;
        }
    }
    if(!isok)
    {
        flag = true;
        printf("-1\n");
    }
    if(t == 1)   //输入为1 0
    {
        if(cnt[0] == 1)
            printf("1 1\n1 1\n");
        else
            printf("-1\n");
        flag = true;
    }
    if(!flag)   //其他情况
        printf("-1\n");
    return 0;
}