QOJ.ac

#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;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

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:

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:

Subtask #3:

score: 0

Skipped

Dependency #2:

Subtask #4:

score: 0

Skipped

Dependency #3:

Subtask #5:

score: 20

Accepted