poj 3685(二分查找第K大的值）

最新推荐文章于 2024-03-04 10:50:06 发布

mrcoderrev

最新推荐文章于 2024-03-04 10:50:06 发布

阅读量524

点赞数

分类专栏：二分搜索

本文链接：https://blog.csdn.net/yjf3151731373/article/details/52396055

版权

二分搜索专栏收录该内容

28 篇文章 0 订阅

订阅专栏

Matrix

Time Limit: 6000MS

Memory Limit: 65536KB

64bit IO Format: %lld & %llu

Submit Status

Description

Given a N × N matrix A, whose element in the i-th row and j-th column A_ij is an number that equals i² + 100000 × i + j² - 100000 × j + i × j, you are to find the M-th smallest element in the matrix.

Input

The first line of input is the number of test case.
For each test case there is only one line contains two integers, N(1 ≤ N ≤ 50,000) and M(1 ≤ M ≤ N × N). There is a blank line before each test case.

Output

For each test case output the answer on a single line.

Sample Input

Sample Output

首先要从给的表达式中找出规律，，，，每一列是单调的，，然后联想二分搜索的特性，，二分答案，枚举每一列，

再二分行标，求出该列能够满足的个数，从而找到矩阵不超过他的个数

注意答案是long long 运算时用的变量也要是long long 不然数据会溢出

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
LL cal(LL x,LL y)
{
return x*x + 100000*x + y*y - 100000*y + x*y;
}
LL judge(LL x);
LL n, m;

int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%I64d %I64d", &n, &m);
LL l=-10000000000000LL,r=10000000000000LL, mid, ans;
while(l<=r)
{
mid=(l+r)/2;
if(judge(mid))
{
r=mid-1;
ans=mid;
}
else
{
l=mid+1;
}
}
printf("%I64d\n",ans);
}
return 0;
}

LL judge(LL x)
{
LL cnt=0;
for(int i=1;i<=n;i++)
{
LL l=1, r=n, mid, ans=0;
while(l<=r)
{
mid=(l+r)/2;
LL h=cal(mid,i);
if(h>x)
{
r=mid-1;
}
else
{
l=mid+1;
ans=mid;
}
}
cnt+=ans;
}
if(cnt>=m)
{
return 1;
}
return 0;
}