QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#409254 | #6744. Square | dremlory | AC ✓ | 55ms | 3652kb | C++23 | 1.3kb | 2024-05-11 20:51:57 | 2024-05-11 20:51:58 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
const int N = 1e6, M = 110, mod = 998244353, inf = 2e9;
const long long D = 1e12;
typedef pair<int, int> pt;
typedef long long ll;
void solve() {
ll a, b;
cin >> a >> b;
if (a >= b) cout << a - b << endl;
else {
auto work = [&](ll a, ll b) -> ll {
int t = (int)(sqrt(2 * a) + 1.5);
ll l = t, r = 2e9;
while (l < r) {
ll mid = l + r >> 1;
if ((mid - t + 1) * (t + mid) / 2 >= b - a) r = mid;
else l = mid + 1;
}
return r - t + 1 + a + (l - t + 1) * (t + l) / 2 - b;
};
ll res = work(a, b);
int t = (int)(sqrt(2 * a) + 1.5);
ll l = a - t, r = a;
while (l < r) {
ll mid = l + r + 1 >> 1;
if ((int)(sqrt(2 * mid) + 1.5) < t) l = mid;
else r = mid - 1;
}
res = min(res, work(l, b) + a - l);
cout << res << endl;
}
}
signed main() {
//freopen("title.in", "r", stdin);
//freopen("std.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int 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: 0ms
memory: 3488kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 55ms
memory: 3652kb
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