QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#400573 | #6744. Square | 1820357523 | AC ✓ | 41ms | 3584kb | C++20 | 1.2kb | 2024-04-27 13:51:49 | 2024-04-27 13:51:50 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define __count __builtin_popcount
#define yes cout<<"Yes\n";
#define no cout<<"No\n";
using namespace std;
void solve() {
ll x, y;
cin >> x >> y;
if (y <= x) {
cout << x - y << endl;
return;
}
ll l, r;
l = 0, r = 2e10 + 7;
while (l + 1 != r) {
ll mid = l + r >> 1;
if (mid * (mid + 1) / 2 >= x) {
r = mid;
} else l = mid;
}
ll xt = r;
xt++;
l = 0;
r = 2e10 + 7;
while (l + 1 != r) {
ll mid = l + r >> 1;
if (mid * (mid + 1) / 2 >= y) {
r = mid;
} else l = mid;
}
ll yt = r;
yt++;
ll ansx = x + (xt + yt - 1) * (yt - xt) / 2;
// cout << x << " " << y << " " << xt << " " << yt << " " << ansx << endl;
if (ansx < y) {
ll bnsx = y - (xt + yt - 1) * (yt - xt) / 2;
bnsx -= (xt - 1);
// cout << bnsx << endl;
cout << x - bnsx + (yt - xt)+1 << endl;
} else {
cout << ansx - y + (yt - xt) << endl;
}
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll t = 1;
cin >> t;
while (t--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 41ms
memory: 3568kb
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