QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#412777 | #6744. Square | Sunlight9# | AC ✓ | 31ms | 3600kb | C++17 | 901b | 2024-05-16 19:20:05 | 2024-05-16 19:20:06 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll x,y;
ll dx,dy;
ll dis(ll cnt){
// ll pos=1;
// while (pos*(pos+1)/2<cnt) pos++;
ll l=1LL,r=2e9,mid,pos=1LL;
while(l<=r)
{
mid=(l+r)>>1;
if(mid*(mid+1LL)/2LL>=cnt) pos=mid,r=mid-1LL;
else l=mid+1LL;
}
return pos;
}
void solve(){
cin>>x>>y;
if (x>=y) {cout<<x-y<<'\n';return ;}
dx=dis(x),dy=dis(y);
//cout<<dx<<" "<<dy<<endl;5
ll ans=0,rx=dx*(dx+1)/2,ry=dy*(dy+1)/2;
if (rx-x<=ry-y){
ans=dy-dx+(ry-y)-(rx-x);
cout<<ans<<'\n';
}
else{
ll ny=dx*(dx-1)/2-(ry-y);
ans=x-ny+dy-dx+1;
cout<<ans<<'\n';
}
return ;
}
int main()
{
cin.tie(nullptr) -> sync_with_stdio(false);
int t;cin>>t;
while (t--) solve();
//cout<<dx<<" "<<dy<<endl;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 31ms
memory: 3600kb
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