QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#413074 | #6744. Square | Ado1phosa | AC ✓ | 46ms | 3696kb | C++17 | 1.2kb | 2024-05-17 02:40:04 | 2024-05-17 02:40:05 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
using i64 = long long;
#define debug2(a, b) cout << #a << " = " << a << " " << #b << " = " << b << '\n';
void solve() {
i64 x, y;
cin >> x >> y;
auto get1 = [&](i64 x) {
i64 l = 0, r = 2E9;
i64 R = sqrtl(2 * x) + 1.5;
auto check = [&](i64 c) {
return (R + R + c - 1) * c / 2 + x >= y;
};
i64 ans = 0;
while (l <= r) {
i64 mid = (l + r) >> 1;
if (check(mid)) {
r = mid - 1;
ans = mid;
} else {
l = mid + 1;
}
}
return (R + R + ans - 1) * ans / 2 + x - y + ans;
};
auto get2 = [&](i64 x) {
i64 R = sqrtl(2 * x) + 1.5;
if (R == 2) {
return i64(1E18);
}
return get1((R - 1) * (R - 2) / 2) + x - (R - 1) * (R - 2) / 2;
};
// debug2(get1(x), get2(x));
cout << min(get1(x), get2(x)) << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3664kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 46ms
memory: 3696kb
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