QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#252402#6744. Squareucup-team191#AC ✓30ms1608kbC++14691b2023-11-15 19:16:222023-11-15 19:16:22

Judging History

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

  • [2023-11-15 19:16:22]
  • 评测
  • 测评结果:AC
  • 用时:30ms
  • 内存:1608kb
  • [2023-11-15 19:16:22]
  • 提交

answer

#include <cstdio>

using namespace std;

typedef long long ll;

ll nadi_grupu(ll x){
	ll ret = 0;
	for(int i = 31;i >= 0;i--) {
		ret += (1LL << i);
		if(ret * (ret + 1) >= 2 * x)
			ret -= (1LL << i);
	}
	return ret;
}

ll x, y;

void solve(){
	scanf("%lld%lld", &x, &y);
	if(y <= x) {
		printf("%lld\n", x - y);
		return;
	}
	ll x1 = nadi_grupu(x); 
	ll y1 = nadi_grupu(y);
	ll x2 = x - x1 * (x1 + 1) / 2 - 1;
	ll y2 = y - y1 * (y1 + 1) / 2 - 1;
	if(x1 - x2 <= y1 - y2)
		printf("%lld\n", (y1 - y2) - (x1 - x2) + y1 - x1);
	else
		printf("%lld\n", x2 + y1 - y2 + 2 + y1 - x1);	
}

int main(){
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}

详细

Test #1:

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

input:

2
5 1
1 5

output:

4
3

result:

ok 2 number(s): "4 3"

Test #2:

score: 0
Accepted
time: 30ms
memory: 1608kb

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