QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#246804 | #6744. Square | HuanGWe_10 | AC ✓ | 24ms | 3544kb | C++14 | 919b | 2023-11-11 09:46:11 | 2023-11-11 09:46:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#ifdef local
#include<local/debug>
#else
#define dbg(...)
#endif
using ll = long long;
ll s, t;
ll jp (ll x) {
return (ll)(sqrt (2 * x) + 1.5) - 1;
}
void solve() {
cin >> s >> t;
if (s >= t) {
cout << s - t << "\n";
return ;
}
ll pos_s = jp (s);
ll rt_s = (pos_s * (pos_s + 1) / 2) - s;
ll lft_s = s - (pos_s * (pos_s - 1) / 2 + 1);
ll pos_t = jp (t);
ll rt_t = (pos_t * (pos_t + 1) / 2) - t;
ll lft_t = t - (pos_t * (pos_t - 1) / 2 + 1);
if (rt_s <= rt_t) {
cout << pos_t - pos_s + rt_t - rt_s << "\n";
} else {
cout << pos_t - pos_s + 1 + lft_s + pos_t - lft_t << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3348kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 24ms
memory: 3544kb
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