QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#177155#6744. Squareucup-team870#AC ✓23ms3932kbC++171002b2023-09-12 16:40:112023-09-12 16:40:12

Judging History

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

  • [2023-09-12 16:40:12]
  • 评测
  • 测评结果:AC
  • 用时:23ms
  • 内存:3932kb
  • [2023-09-12 16:40:11]
  • 提交

answer

#include <bits/stdc++.h>
#define For(i,l,r) for(int i=l; i<=r; i++)
using namespace std;
typedef unsigned long long ll;
ll read(){
    ll x; scanf("%lld",&x); return x;
}
ll s;
ll sol(ll x,ll y){
    s=sqrt(x*2)+1.5;
    //change
    while((s*2-3)*(s*2-3)<=x*8) ++s;
    while((s*2-3)*(s*2-3)>x*8) --s;
    //work
    ll b=s*2-1,c=(y-x)*2;
    ll k=(sqrt(b*b+c*4)-b)/2.0; //cout<<x<<' '<<y<<'#'<<s<<' '<<b<<' '<<c<<' '<<k<<endl;
    ll t=x+k*(s*2+k-1)/2;
    while(t>=y&&k){
        --k; t=x+k*(s*2+k-1)/2;
    }
    while(t<y) {
        ++k; t=x+k*(s*2+k-1)/2;
    }
    //cout<<' '<<k<<endl;
    return k+t-y;
}
int main(){
    int _=read();
    while(_--){
        ll x=read(),y=read();
        //ll x=rand(),y=rand();
        if (x>=y) {printf("%lld\n",x-y); continue;}
        ll ans=sol(x,y);
        if (x>1){
            ll la=(s-1)*(s-2)/2;
            ans=min(ans,x-la+sol(la,y));
        }
        ll an=ans; printf("%lld\n",an);
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3928kb

input:

2
5 1
1 5

output:

4
3

result:

ok 2 number(s): "4 3"

Test #2:

score: 0
Accepted
time: 23ms
memory: 3932kb

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