题解
二分答案,
那么小于等于mid的数的个数就是:
∑mi=1mid/i
但是这样只有80分。
关键慢的主要是
求:
∑mi=1mid/i
观察可以发现,里面有着很多数都是相同的,
那么就分块。
code
#include<queue>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include <cstring>
#include <string.h>
#include <cmath>
#include <math.h>
#define ll long long
#define N 1003
#define db double
#define P putchar
#define G getchar
#define mo 1000000007
using namespace std;
char ch;
void read(ll &n)
{
n=0;
ch=G();
while((ch<'0' || ch>'9') && ch!='-')ch=G();
ll w=1;
if(ch=='-')w=-1,ch=G();
while('0'<=ch && ch<='9')n=(n<<3)+(n<<1)+ch-'0',ch=G();
n*=w;
}
int max(int a,int b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
ll abs(ll x){return x<0?-x:x;}
ll sqr(ll x){return x*x;}
void write(ll x){if(x>9) write(x/10);P(x%10+'0');}
void writeln(ll x){write(x);P('\n');}
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
ll n,m,q,k,l,r,mid,ans,s;
int main()
{
freopen("matrix.in","r",stdin);
freopen("matrix.out","w",stdout);
read(n);read(m);read(q);
if(n<m)swap(n,m);
while(q--)
{
read(k);
l=1;ans=r=k;
while(l<=r)
{
mid=(l+r)>>1;
s=0;
for(int i=1;(mid/i)>0 && s<k;i++)
s+=(mid/i)*(min(mid/(mid/i),m)-i+1),i=mid/(mid/i);
if(s>=k)r=mid-1;else ans=l=mid+1;
}
writeln(ans);
}
}