QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#473126#4328. DugputPorNPtree0 0ms3892kbC++17302b2024-07-11 22:08:232024-10-24 22:48:09

Judging History

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

  • [2024-10-24 22:48:09]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:3892kb
  • [2024-10-24 22:43:24]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:3748kb
  • [2024-10-24 22:23:27]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:3888kb
  • [2024-10-24 22:20:49]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:3872kb
  • [2024-07-25 15:13:23]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:3868kb
  • [2024-07-11 22:08:23]
  • 评测
  • 测评结果:20
  • 用时:0ms
  • 内存:3756kb
  • [2024-07-11 22:08:23]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n, m, a, b, c, d;
        scanf("%d%d%d%d%d%d", &n, &m, &a, &b, &c, &d);
        printf("%d\n", n * m - (((n * m) & 1) == ((a + b + c + d) & 1)));
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

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

input:

1
1562
15 6 1 6 15 1
15 6 5 6 11 1
15 6 15 2 1 5
15 6 1 6 1 3
15 6 15 6 11 6
15 6 1 1 4 2
15 6 2 1 9 2
15 6 4 5 9 4
15 6 4 5 4 6
15 6 9 2 3 2
15 6 9 2 6 5
2 41 1 41 2 1
2 41 1 24 2 9
2 41 2 2 1 10
2 41 1 1 1 14
2 41 2 1 1 10
2 41 2 16 2 17
2 41 1 28 2 35
2 41 2 9 1 36
2 41 1 18 ...

output:

23429

result:

wrong answer invalid map: (1, 1) is 2, but it should be either o or * (test case 1)

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Skipped

Dependency #3:

0%

Subtask #5:

score: 0
Wrong Answer

Test #5:

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

input:

5
1562
165 500 1 500 165 500
165 500 78 500 1 401
165 500 165 469 104 500
165 500 1 1 165 298
165 500 165 1 1 499
165 500 165 1 4 122
165 500 8 1 85 361
165 500 112 191 152 254
165 500 112 191 114 190
165 500 49 106 64 350
165 500 49 106 48 108
22 500 22 500 22 1
22 500 20 1 1 387
22 ...

output:

257729
82500
66165
82500
49170

result:

wrong answer read 257729 but expected 82499 (test case 1)