QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#164597 | #6744. Square | Uchear | AC ✓ | 28ms | 3524kb | C++20 | 992b | 2023-09-05 10:55:01 | 2023-09-05 10:55:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define VI vector<int>
#define i128 __int128
typedef long long ll;
typedef pair<int,int> PII;
#define debug(x, y) cout << '#' << x << '+' << y << endl
int sum(int x) { return x * (x + 1) / 2; }
int get(int x)
{
int l = 1, r = 2e9;
while(l < r)
{
int mid = l + r >> 1;
if (sum(mid) >= x) r = mid;
else l = mid + 1;
}
return l;
}
void solve()
{
int a, b;
cin >> a >> b;
if (b < a) cout << a - b << '\n';
else {
int la = get(a), lb = get(b);
int ans = sum(lb) - b - (sum(la) - a);
if (ans < 0)
{
ans = sum(lb) - b + (a - sum(la - 1)) + 1;
}
cout << lb - la + ans << '\n';
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
T = 1;
cin >> T;
while(T -- )
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3524kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 28ms
memory: 3516kb
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