观察此题给出的条件 i^2 + 100000 × i + j^2 - 100000 × j + i × j可知,这个函数值随i的增大而增大,因此在写二分条件的时候可以从每一列开始寻找小于等于mid的值是在该列的第几个,由此得出该列小于等于mid的个数,将所有列加起来就是矩阵中比mid小的所有个数,再与m比较即可。
#include <cstdio>
long long f(long long i, long long j) {
return i * i + 100000 * i + j * j - 100000 * j + i * j;
}
bool judge(long long x, long long n, long long m) {
long long cnt = 0;
for (int j = 1; j <= n; j++) {
int lb = 0;
int ub = n + 1;
while (ub - lb > 1) {
int i = (lb + ub) / 2;
if (f(i, j) <= x) {
lb = i;
} else {
ub = i;
}
}
cnt += lb;
}
return cnt < m;
}
int main(int argc, char const *argv[]) {
int t;
scanf("%d", &t);
while (t--) {
long long n, m;
scanf("%lld%lld", &n, &m);
long long lb = -100000 * n;
long long ub = 3 * n * n + 100000 * n;
while (ub - lb > 1) {
// printf("%lld %lld\n", lb, ub);
long long mid = (lb + ub) / 2;
if (judge(mid, n, m)) {
lb = mid;
} else {
ub = mid;
}
}
printf("%lld\n", ub);
}
return 0;
}
这道题不用long long就wa….