QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #473127 | #4328. Dugput | PorNPtree | 20 | 1ms | 3952kb | C++17 | 305b | 2024-07-11 22:09:15 | 2024-07-11 22:09:15 |
Judging History
你现在查看的是测评时间为 2024-07-11 22:09:15 的历史记录
- [2024-07-11 22:09:15]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
signed main() {
int T; scanf("%*d%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;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3952kb
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:
90 90 90 90 89 89 89 89 90 89 89 82 81 82 82 81 82 81 81 82 93 93 93 92 93 92 93 93 93 93 93 95 95 96 96 96 95 96 95 96 96 95 100 99 99 99 99 99 100 99 100 99 98 98 98 98 98 99 98 99 98 98 99 98 98 98 99 98 98 98 98 98 98 99 98 99 99 99 98 98 98 98 98 99 76 76 76 76 76 76 76 75 75 100 99 99 100 100 ...
result:
wrong answer invalid map: (1, 1) is 9, 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: 20
Accepted