QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#412615 | #6744. Square | sheppard23 | AC ✓ | 110ms | 3708kb | C++14 | 872b | 2024-05-16 16:44:10 | 2024-05-16 16:44:10 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
int f(int x)
{
return x + (int)(sqrtl(2 * x) + 1.5);
}
int cal(int a, int d, int b)
{
return (int)(ceil((-(2 * d - 1) + sqrtl((2 * d - 1) * (2 * d - 1) - 4 * (2 * a - 2 * b))) * 1.0 / 2.0));
}
void solve()
{
int a, b;
cin >> a >> b;
if (a >= b)
cout << a - b << endl;
else
{
int da = f(a) - a;
int n = cal(a, da, b);
int dy = n * da + a + (n - 1) * n / 2 - b;
int ans = (n + dy);
n=cal(1,2,a);
n=n * 2 + 1 + (n - 1) * n / 2;
da=f(n)-n;
da--;
int tmp=a-(n-da);
a=n-da;
n = cal(a, da, b);
dy = n * da + a + (n - 1) * n / 2 - b;
ans=min(ans,tmp+n+dy);
cout<<ans<<endl;
}
}
signed main()
{
int tt;
cin >> tt;
while (tt--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3708kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 110ms
memory: 3688kb
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