QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#165102 | #6744. Square | mendicillin2# | AC ✓ | 11ms | 3852kb | C++14 | 1.2kb | 2023-09-05 15:57:37 | 2023-09-05 15:57:37 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0' && c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
#define pii pair<int,int>
inline pii ask(int x)
{
int lef=1, rig=2e9;
while(lef<rig)
{
int mid=(lef+rig)>>1;
if(mid*(mid+1)/2>=x) rig=mid;
else lef=mid+1;
}
int w=x-lef*(lef-1)/2;
return pii(lef,w);
}
inline int ask1(pii k1,pii k2)
{
int ans=k2.first-k1.first;
k1.first+=ans; k1.second+=ans;
if(k1.second<k2.second) return (int)1e18;
return ans+k1.second-k2.second;
}
inline int ask2(pii k1,pii k2)
{
int ans=k1.second;
k1.first--;
k1.second=k1.first;
return ans+ask1(k1,k2);
}
signed main()
{
int x,y;
int T=read();
while(T--)
{
x=read(); y=read();
if(x>=y){
printf("%lld\n",x-y);
continue;
}
pii k1=ask(x), k2=ask(y);
int ans=min(ask1(k1,k2),ask2(k1,k2));
printf("%lld\n",ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3776kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 11ms
memory: 3852kb
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