QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#820459#4541. Black MagicSGColinAC ✓1ms3792kbC++201002b2024-12-18 21:30:262024-12-18 21:30:27

Judging History

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

  • [2024-12-18 21:30:27]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3792kb
  • [2024-12-18 21:30:26]
  • 提交

answer

#include <bits/stdc++.h>
//
#define var auto
#define let auto const
#define mid ((l + r) >> 1)
#define loop for (;;)
#define downTo(n) for (int it{n}; it; --it)
#define repeat(n) for (int it{1}, ed{n}; it <= ed; ++it)
typedef long long Int;
typedef long double real;

int i32() {
    int a{}, b{}, sgn{};
    for (; !isdigit(b); b = getchar()) sgn = b == '-';
    for (; +isdigit(b); b = getchar()) a = a * 10 + b - '0';
    return sgn ? -a : +a;
}

int max(int e, int l, int r, int b) {
    if (l || r)
        return b + std::min(l, r);
    else
        return std::max(b - 1, 0);
}

int min(int e, int l, int r, int b) {
    if (e)
        return std::max(0, b - 1 - e);
    else
        return std::max(b - 1, 0);
}

int main() {
    repeat(i32()) {
        int e = i32();
        int l = i32();
        int r = i32();
        int b = i32();
        int sum = e + l + r + b;
        printf("%d %d\n", sum - max(e, l, r, b), sum - min(e, l, r, b));
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4000
0 0 0 1
0 0 0 100000
0 0 0 11
0 0 0 12
0 0 0 13
0 0 0 2
0 0 0 25
0 0 0 3
0 0 0 4
0 0 0 5
0 0 0 6
0 0 0 7
0 0 0 8
0 0 0 9
0 0 1 0
0 0 1 1
0 0 1 12
0 0 1 14
0 0 1 17
0 0 1 2
0 0 1 21
0 0 1 3
0 0 1 4
0 0 1 5
0 0 1 6
0 0 1 7
0 0 1 8
0 0 1 9
0 0 100000 0
0 0 11 6
0 0 12 3
0 0 12 4
0 0 13 0
0 0 13 12...

output:

1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1 2
100000 100000
11 12
12 13
12 13
13 13
13 14
13 14
14 15
16 16
16 17
16 17
2 2
2 3
2 3
2 3
2 3
2 3
2 3
2 3
2 3
2 3
2 3
2 3
2 3
26 27
3 3
3 4
3 4
3 4
3 4
3 4
3 4
3 4
3 4
3 4
3 4
3 4
4 4
4 5
...

result:

ok 4000 lines