QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#157575#7102. Live Loveucup-team1087#WA 1ms3928kbC++111015b2023-09-02 15:34:302023-09-02 15:34:30

Judging History

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

  • [2023-09-02 15:34:30]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3928kb
  • [2023-09-02 15:34:30]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

int main() {
    int t;
    scanf("%d", &t);
    for (int n, m; t--; ) {
        scanf("%d%d", &n, &m);
        printf("%d ", m);
        if (m == 0) {
            puts("0");
            continue;
        }
        if (((n + 1) >> 1) >= m) {
            puts("1");
            continue;
        }
        if (n == m) {
            printf("%d\n", m);
            continue;
        }
        m -= (n >> 1);
        if (n & 1) {
            printf("%d\n", min(((m + 1) >> 1) << 1, ((m >> 1) << 1) + 1));
        }
        else {
            if (m < 3) {
                if (m == 1)
                    puts("2");
                else if (m == 2)
                    puts("3");
                else
                    puts("1");
            }
            else {
                m -= 2;
                printf("%d\n", min(2 + (((m + 1) >> 1) << 1), 3 + ((m - ((m + 1) >> 1)) << 1)));
            }
        }
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5
5 4
100 50
252 52
3 0
10 10

output:

4 2
50 1
52 1
0 0
10 10

result:

ok 5 lines

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3928kb

input:

100
13 3
384 171
94 36
581 70
782 715
651 287
810 789
353 314
2 2
65 47
684 194
242 213
135 42
695 484
512 195
14 0
721 253
665 257
381 78
456 220
1000 500
1000 501
31 31
703 484
137 1
271 55
666 366
966 316
457 248
166 38
716 679
972 258
627 91
380 1
451 436
605 173
987 780
457 180
2 0
718 574
119 ...

output:

3 1
171 1
36 1
70 1
715 324
287 1
789 384
314 138
2 2
47 15
194 1
213 92
42 1
484 137
195 1
0 0
253 1
257 1
78 1
220 1
500 1
501 2
31 31
484 133
1 1
55 1
366 33
316 1
248 20
38 1
679 321
258 1
91 1
1 1
436 211
173 1
780 287
180 1
0 0
574 215
8 1
118 1
126 1
12 3
34 1
381 182
658 239
288 98
161 1
76 ...

result:

wrong answer 5th lines differ - expected: '715 11', found: '715 324'