QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#398148 | #6744. Square | dqjm | AC ✓ | 76ms | 3632kb | C++20 | 1.5kb | 2024-04-24 23:24:01 | 2024-04-24 23:24:01 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define int long long
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int x,y;
cin>>x>>y;
if(x>=y){
cout<<x-y<<endl;
continue;
}
int z=floor(sqrtl(2*x)+1.5);
int l=1,r=x;
int jian=0;
while(l<=r){
int mid=(l+r)/2;
if(floor(sqrtl(2*mid)+1.5)==z){
jian=mid;
r=mid-1;
}
else {
l=mid+1;
}
}
l=z,r=1e9*1.5;
int ans=z;
while(l<=r){
int mid=(l+r)/2;
if(x+(z+mid)*(mid-z+1)/2>=y){
ans=mid;
r=mid-1;
}
else {
l=mid+1;
}
}
int ed=x+(z+ans)*(ans-z+1)/2;
int z1=floor(sqrtl(2*ed)+1.5),z2=floor(sqrtl(2*y)+1.5);
if(z1==z2){
cout<<ans-z+1+ed-y<<endl;
}
else {
l=1,r=ed;
while(l<=r){
int mid=(l+r)/2;
int w=floor(sqrtl(2*mid)+1.5);
if(w==z2+1){
ed=mid;
r=mid-1;
}
else {
l=mid+1;
}
}
cout<<ans-z+ed-y+(x-jian)+1<<endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3584kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 76ms
memory: 3632kb
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