QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#473127#4328. DugputPorNPtree0 1ms3860kbC++17305b2024-07-11 22:09:152024-10-24 22:43:24

Judging History

你现在查看的是测评时间为 2024-10-24 22:43:24 的历史记录

  • [2024-10-24 22:48:10]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:3860kb
  • [2024-10-24 22:43:24]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:3860kb
  • [2024-10-24 22:23:27]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:3944kb
  • [2024-10-24 22:20:51]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:3896kb
  • [2024-07-25 15:13:24]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:3944kb
  • [2024-07-11 22:09:15]
  • 评测
  • 测评结果:20
  • 用时:1ms
  • 内存:3952kb
  • [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: 3860kb

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: 0
Wrong Answer

Test #5:

score: 0
Wrong Answer
time: 1ms
memory: 3736kb

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:

82499
82499
82499
82500
82499
82499
82500
82500
82500
82500
82500
11000
11000
10999
10999
10999
11000
10999
11000
11000
11000
10999
10499
10500
10500
10500
10500
10500
10500
10500
10500
10500
10499
30000
30000
29999
29999
29999
30000
30000
29999
30000
29999
30000
39999
39999
40000
40000
40000
40000
...

result:

wrong answer read 1500 but expected 1498 (test case 99)