有一个N阶方阵 第i行,j列的值Aij =i2 + 100000 × i + j2 - 100000 × j + i × j,需要找出这个方阵的第M小值.
Input
第一行输入T代表测试组数.
每个测试用例包含2个数字N,M表示在N阶方阵找出第M大值, N(1 ≤ N ≤ 50,000) and M(1 ≤ M ≤ N × N). 每两个测试用例之间可能有空行
Output
输出方阵的第M小值
Sample Input
10
50000 2500000000
48888 2000000000
47777 1500000000
46666 1200000000
45555 1000000000
44444 900000000
43333 800000000
42222 700000000
41111 600000000
40000 500000000
Sample Output
7500000000
5129139981
3273537711
2261727633
1634929103
1368488613
1096871427
820144979
538443492
251994213
//a[i][j]=i^2+100000*i+j^2-100000*j+i*j
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
using namespace std;
typedef __int64 LL;
LL n, m;
LL F(LL l,LL r){
return l*l+100000*l+r*r-100000*r+l*r;
}
LL solve(LL x){
LL sum=0;
for(int i=1;i<=n;i++){
int l=1,r=n+1;
while(l<r){
LL mid=(l+r)/2;
if(F(mid,i)>x){
r=mid;
}else{
l=mid+1;
}
}
sum+=l-1;
}
return sum;
}
int main(){
int t;
while(scanf("%d",&t)!=EOF){
while(t--){
cin>>n>>m;
LL l=-100000*n,r=n*n+100000*n+n*n+n*n;//这一点真的难想到
while(l<r){
LL mid=(l+r)>>1;
if(solve(mid)<m){
l=mid+1;
}else{
r=mid;
}
}
cout<<l<<'\n';
}
}
}