Codeforces Educational 38 C. Constructing Tests （ 构造

题目描述

Let’s denote a m-free matrix as a binary (that is, consisting of only 1’s and 0’s) matrix such that every square submatrix of size m × m of this matrix contains at least one zero.

Consider the following problem:

You are given two integers n and m. You have to construct an m-free square matrix of size n × n such that the number of 1’s in this matrix is maximum possible. Print the maximum possible number of 1’s in such matrix.

You don’t have to solve this problem. Instead, you have to construct a few tests for it.

You will be given t numbers x1, x2, …, xt. For every , find two integers ni and mi (ni ≥ mi) such that the answer for the aforementioned problem is exactly xi if we set n = ni and m = mi.

输入

The first line contains one integer t (1 ≤ t ≤ 100) — the number of tests you have to construct.

Then t lines follow, i-th line containing one integer xi (0 ≤ xi ≤ 109).

输出

For each test you have to construct, output two positive numbers ni and mi (1 ≤ mi ≤ ni ≤ 109) such that the maximum number of 1’s in a mi-free ni × ni matrix is exactly xi. If there are multiple solutions, you may output any of them; and if this is impossible to construct a test, output a single integer  - 1.

样例

input
3
21
0
1
output
5 2
1 1
-1

题意

一个$n*n的01$矩阵 让任意一个子矩阵$m*m$里面至少有一个0,其余为1。
现在我们来构造这个矩阵，明显 如果是一个序列的话 每个序列最少要放置$n/m$个零,推广到矩阵得到公式直接枚举
$n^2-(n/m)^2=x$

AC代码

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define CLR(a,b) memset(a,(b),sizeof(a))

const int MAXN = 2e5+11;
const int INF = 0x3f3f3f3f;
const LL INFLL = ~0ull>>1;

int main()
{
    ios::sync_with_stdio(false),cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
        LL x;
        cin >> x;
        if(x == 0)
            cout << 1 << ' ' << 1 << endl;
        else {
            bool flag = false;
            for(LL i = 1; i <= MAXN; i++) {
                if(x >= i*i) continue;
                LL k = sqrt(i*i-x);
                if(k*k == i*i-x) {
                    LL m = i/k;
                    if(m > (i/(k+1))) {            // 确保n/m取整
                        cout << i << ' ' << m << endl;
                        flag = true; break;
                    }
                }
            }
            if(!flag) cout << -1 << endl;
        }
    }
}