QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#862686#9675. 电池检测H_Z_J5 1ms3840kbC++20834b2025-01-19 08:08:462025-01-19 08:08:46

Judging History

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

  • [2025-01-19 08:08:46]
  • 评测
  • 测评结果:5
  • 用时:1ms
  • 内存:3840kb
  • [2025-01-19 08:08:46]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, j, k) for(int i=j;i<=k;++i)
#define rep1(i, j, k) for(int i=k;i>=j;--i)
#define pii pair<int, int> 
#define pb push_back
#define ft first
#define sd second

using namespace std;

int T, a, b;

int calc(int a, int b){
	if(a==1) return 2e9;
	return (a+b)/2+3*(b-a)+(b-a)*(b-a)/2+4;
}

int main(){
	
	scanf("%d", &T);
	while(T--){
		scanf("%d%d", &a, &b);
		
		int ans=0; 
		if(a>b) ans=b+1+(a==b+1);
		else if(!((a+b)&1)) ans=calc(a, b);
		else ans=min(calc(a-1, b), calc(a, b-1)+b-a+3);
		
		int c=b>>1;
		if(!(b&1)){
			if(a>c) ans=min(ans, c*3+1+(a==c+1)*2);
//			else 
		}else{
			if(a>c) ans=min(ans, c*3+3+3*(a==c+1));
		}
		
		printf("%d\n", ans);
		
	}
	
	return 0;
}
/*

0 0 1

a > 

*/

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 10
Accepted
time: 1ms
memory: 3840kb

input:

3
2 1
3 1
2 2

output:

3
2
6

result:

ok 3 number(s): "3 2 6"

Test #2:

score: 0
Wrong Answer
time: 0ms
memory: 3840kb

input:

12
2 1
2 2
2 3
2 4
3 1
3 2
3 3
3 4
4 1
4 2
4 3
4 4

output:

3
6
9
15
2
4
6
9
2
3
5
7

result:

wrong answer 3rd numbers differ - expected: '10', found: '9'

Subtask #2:

score: 0
Wrong Answer

Test #3:

score: 0
Wrong Answer
time: 1ms
memory: 3840kb

input:

1000
2 1
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
2 27
2 28
2 29
2 30
2 31
2 32
2 33
2 34
2 35
2 36
2 37
2 38
2 39
2 40
2 41
2 42
2 43
2 44
2 45
2 46
2 47
2 48
2 49
2 50
2 51
2 52
2 53
2 54
2 55
2 56
2 57
2 58
2 59
2 60
2 61...

output:

3
6
9
15
21
28
36
45
55
66
78
91
105
120
136
153
171
190
210
231
253
276
300
325
351
378
406
435
465
496
528
561
595
630
666
703
741
780
820
861
903
946
990
1035
1081
1128
1176
1225
1275
1326
1378
1431
1485
1540
1596
1653
1711
1770
1830
1891
1953
2016
2080
2145
2211
2278
2346
2415
2485
2556
2628
270...

result:

wrong answer 3rd numbers differ - expected: '10', found: '9'

Subtask #3:

score: 0
Wrong Answer

Test #4:

score: 0
Wrong Answer
time: 1ms
memory: 3840kb

input:

1000
3 1
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
3 13
3 14
3 15
3 16
3 17
3 18
3 19
3 20
3 21
3 22
3 23
3 24
3 25
3 26
3 27
3 28
3 29
3 30
3 31
3 32
3 33
3 34
3 35
3 36
3 37
3 38
3 39
3 40
3 41
3 42
3 43
3 44
3 45
3 46
3 47
3 48
3 49
3 50
3 51
3 52
3 53
3 54
3 55
3 56
3 57
3 58
3 59
3 60
3 61...

output:

2
4
6
9
12
22
29
37
46
56
67
79
92
106
121
137
154
172
191
211
232
254
277
301
326
352
379
407
436
466
497
529
562
596
631
667
704
742
781
821
862
904
947
991
1036
1082
1129
1177
1226
1276
1327
1379
1432
1486
1541
1597
1654
1712
1771
1831
1892
1954
2017
2081
2146
2212
2279
2347
2416
2486
2557
2629
2...

result:

wrong answer 6th numbers differ - expected: '16', found: '22'

Subtask #4:

score: 5
Accepted

Test #5:

score: 5
Accepted
time: 1ms
memory: 3840kb

input:

1000
907 241
495 435
227 139
616 1
433 35
588 407
533 322
995 961
748 310
212 36
968 500
294 187
375 371
307 14
648 180
122 28
304 253
818 812
41 5
286 62
573 340
547 224
347 35
279 56
151 85
626 410
456 248
578 470
11 6
952 771
404 302
77 27
168 40
524 517
171 147
407 294
268 106
100 27
549 196
973...

output:

242
436
140
2
36
408
323
962
311
37
501
188
372
15
181
29
254
813
6
63
341
225
36
57
86
411
249
471
7
772
303
28
41
518
148
295
107
28
197
374
35
337
236
92
714
832
465
377
70
496
141
52
38
47
632
355
96
329
130
395
233
124
815
408
201
20
56
630
544
62
379
618
415
17
131
265
179
232
316
109
60
266
7...

result:

ok 1000 numbers

Subtask #5:

score: 0
Skipped

Dependency #1:

0%

Subtask #6:

score: 0
Skipped

Dependency #5:

0%

Subtask #7:

score: 0
Skipped

Dependency #1:

0%