QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#695641#6744. SquarefgzAC ✓94ms3672kbC++231.3kb2024-10-31 20:30:102024-10-31 20:30:12

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 20:30:12]
  • 评测
  • 测评结果:AC
  • 用时:94ms
  • 内存:3672kb
  • [2024-10-31 20:30:10]
  • 提交

answer

#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0), cin.tie(0)
#define time chrono::system_clock::now().time_since_epoch().count()
using namespace std;
#define int long long
using ll = long long;
using pll = pair<int, int>;

const int mod = 1e9 + 7, N = 2e5 + 10;

void solve() {
    int x, y; cin >> x >> y;
    int d = sqrt(2 * x) + 1.5;
    d --;

    auto get1 = [&](int num) {
        int s = sqrt(2 * num) + 1.5;
        auto check = [&] (int n) {
            int t = num + (s + s + n - 1) * n / 2;
            return t >= y;
        };
        int l = 0, r = 2e9;
        while (l < r) {
            int mid = l + r >> 1;
            if (check(mid)) r = mid;
            else l = mid + 1;
        }
        int res = num + (s + s + r - 1) * r / 2;
        return r + (res - y);
    };

    auto get2 = [&]() {
        auto ok = [&] (int t) {
            int s = sqrt(2 * t) + 1.5;
            return s <= d;
        };
        int l = 0, r = 1e18;
        while(l < r) {
            int mid = l + r + 1 >> 1;
            if (ok(mid)) l = mid;
            else r = mid - 1;
        }
        return get1(r) + (x - r);
    };
    // cout << get1(x) << ' ';
    cout << min(get1(x), get2()) << '\n';
}

signed main()
{
    ios;
    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: 3672kb

input:

2
5 1
1 5

output:

4
3

result:

ok 2 number(s): "4 3"

Test #2:

score: 0
Accepted
time: 94ms
memory: 3656kb

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