QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#873256#9675. 电池检测fishPJ#5 1ms3840kbC++141.9kb2025-01-26 11:03:382025-01-26 11:03:39

Judging History

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

  • [2025-01-26 11:03:39]
  • 评测
  • 测评结果：5
  • 用时：1ms
  • 内存：3840kb
查看
  • [2025-01-26 11:03:38]
  • 提交

answer

#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define per(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define RD read()
#define PN putchar('\n')
using namespace std;
bool MemoryBegin;
inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
    while('0' <= ch && ch <= '9') { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
    return x * f;
}

int const N = 1e3 + 5;

int f[N][N];

signed main() {
    //cerr << fabs(&MemoryBegin - &MemoryEnd) / 1048576.0 << " MB\n";
    // memset(f, 0x3f, sizeof f);
    // rep(i, 2, N - 1) f[i][0] = 1, f[i][1] = 2;
    // f[2][1] = 3;
    // rep(i, 1, N - 1) {
    //     rep(j, 2, N - 1) {
    //         f[i][j] = max(f[i][j - 1] + i, f[i][j - 2] + 2 * (i + j - 2) + 1);
            // if(j > 1) f[i][j] = min(f[i][j - 2] + 1, min(f[i - 1][j - 1] + 1, f[i][j - 2] + 2 * (i + j - 2) + 1));
            // else f[i][j] = min(f[i - 1][j - 1] + 1, f[i][j - 1] + i);
    //     }
    // }
    int T = RD;
    while(T --) {
        int a = RD, b = RD, n = a + b, t = n / 2, ans;
        if(b & 1) {
            if(b < t) ans = b + 1;
            else if(b == t) ans = b + 2;
            else {
                int x = b - (t + 1);
                ans = t + (x + 1) * 2 + 2;
            }
        } else {
            if(b < t) ans = b + 1;
            else if(b == t) ans = t + 4;
            else {
                int x = b - t;
                ans = t + (x + 1) * 2 + 2;
            }
        }
        printf("%lld\n", ans);
    }
    // rep(i, 1, 10) {
    //     cerr << endl;
    //     rep(j, 1, 10) {
    //         cerr << i << ' ' << j << ' ' << f[i][j] << endl;
    //     }
    // }
    // cerr << "\n" << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << " ms\n";
    return 0;
}
源文件, 语言: C++14

详细

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: 1ms
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
6
9
2
6
5
9
2
3
5
8

result:

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

Subtask #2:

score: 0
Wrong Answer

Test #3:

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

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
6
9
9
12
12
15
15
18
18
21
21
24
24
27
27
30
30
33
33
36
36
39
39
42
42
45
45
48
48
51
51
54
54
57
57
60
60
63
63
66
66
69
69
72
72
75
75
78
78
81
81
84
84
87
87
90
90
93
93
96
96
99
99
102
102
105
105
108
108
111
111
114
114
117
117
120
120
123
123
126
126
129
129
132
132
135
135
138
138
141
14...

result:

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

Subtask #3:

score: 0
Wrong Answer

Test #4:

score: 0
Wrong Answer
time: 0ms
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
6
5
9
8
12
11
15
14
18
17
21
20
24
23
27
26
30
29
33
32
36
35
39
38
42
41
45
44
48
47
51
50
54
53
57
56
60
59
63
62
66
65
69
68
72
71
75
74
78
77
81
80
84
83
87
86
90
89
93
92
96
95
99
98
102
101
105
104
108
107
111
110
114
113
117
116
120
119
123
122
126
125
129
128
132
131
135
134
138
137
141
14...

result:

wrong answer 2nd numbers differ - expected: '4', found: '6'

Subtask #4:

score: 5
Accepted

Test #5:

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

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%
English 繁體中文 简体中文

服务器时间: 2025-02-01 20:02:59 | 开源项目