QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#218502 | #6744. Square | Geospiza# | AC ✓ | 98ms | 3828kb | C++20 | 1.1kb | 2023-10-18 14:10:22 | 2023-10-18 14:10:22 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define Ma 10000007
#define mod 998244353
#define i128 __int128
using namespace std;
ll inf=8e18;
ll a,b;
ll f(ll x)
{
return (ll)(sqrtl(2*x)+1.5);
}
ll le(ll x)
{
ll l=0,r=inf;
while (l<=r){
ll mid=(l+r)>>1;
if (f(mid)<x)
l=mid+1;
else
r=mid-1;
}
return l;
}
ll re(ll x)
{
ll l=0,r=inf;
while (l<=r){
ll mid=(l+r)>>1;
if (f(mid)<=x)
l=mid+1;
else
r=mid-1;
}
return r;
}
void sol()
{
cin>>a>>b;
if (a>b)
{
printf("%lld\n",a-b);
return;
}
ll be=(ll)(sqrtl(2*a)+1.5);
ll l=0,r=2e9;
while (l<=r){
ll mid=(l+r)>>1;
if (((i128)be*2+mid-1)*mid/2>=b-a)
r=mid-1;
else
l=mid+1;
}
ll ans=l+(be*2+l-1)*l/2+a-b;
ll p=re(be-1),q=re(f(b));
ans=min(ans,a-p+f(b)-be+1+q-b);
printf("%lld\n",ans);
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
ll tt=1;
cin>>tt;
while (tt--)
sol();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 98ms
memory: 3748kb
input:
100000 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 ...
output:
0 2 1 4 3 2 6 5 4 3 8 7 6 5 4 10 9 8 7 6 5 12 11 10 9 8 7 6 14 13 12 11 10 9 8 7 16 15 14 13 12 11 10 9 8 18 17 16 15 14 13 12 11 10 9 20 19 18 17 16 15 14 13 12 11 10 22 21 20 19 18 17 16 15 14 13 12 11 24 23 22 21 20 19 18 17 16 15 14 13 12 26 25 24 23 22 21 20 19 18 1 0 2 2 1 3 4 3 2 4 6 5 4 3 5 ...
result:
ok 100000 numbers