QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#163720 | #6744. Square | ucup-team1209# | AC ✓ | 23ms | 3560kb | C++20 | 802b | 2023-09-04 14:32:23 | 2023-09-04 14:32:23 |
Judging History
answer
#include<bits/stdc++.h>
using u64 = unsigned long long;
using ll = long long;
using std::cin;
using std::cout;
const int mod = 998244353;
struct pr { ll a, b; };
pr cd(ll x) {
ll l = 0, r = 2e9;
for(;l + 1 < r;) {
ll mid = (l + r) / 2;
if(mid * (mid + 1) / 2 < x) {
l = mid;
} else {
r = mid;
}
}
return {l + 1, (l + 1) * (l + 2) / 2 + 1 - x};
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0);
int T;
cin >> T;
for(int i = 0;i < T;++i) {
ll x, y;
cin >> x >> y;
if(y <= x) {
cout << x - y << '\n';
} else {
pr xx = cd(x);
pr yy = cd(y);
pr x = xx;
pr y = yy;
if(y.b >= x.b) {
cout << y.b - x.b + y.a - x.a << '\n';
} else {
cout << y.a - x.a + 1 + y.b + x.a - x.b << '\n';
}
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3560kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 23ms
memory: 3344kb
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