QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#171289#7178. Bishopsucup-team367#WA 10ms3804kbC++141.0kb2023-09-09 16:44:372023-09-09 16:44:43

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 5

output:

6
1 1
2 1
1 3
2 3
1 5
2 5

result:

ok n: 2, m: 5, bishops: 6

Test #2:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

5 5

output:

8
1 1
5 1
1 2
5 2
1 3
5 3
1 4
5 4

result:

ok n: 5, m: 5, bishops: 8

Test #3:

score: 0
Accepted
time: 10ms
memory: 3612kb

input:

100000 100000

output:

199998
1 1
100000 1
1 2
100000 2
1 3
100000 3
1 4
100000 4
1 5
100000 5
1 6
100000 6
1 7
100000 7
1 8
100000 8
1 9
100000 9
1 10
100000 10
1 11
100000 11
1 12
100000 12
1 13
100000 13
1 14
100000 14
1 15
100000 15
1 16
100000 16
1 17
100000 17
1 18
100000 18
1 19
100000 19
1 20
100000 20
1 21
100000...

result:

ok n: 100000, m: 100000, bishops: 199998

Test #4:

score: -100
Wrong Answer
time: 9ms
memory: 3764kb

input:

100000 99999

output:

199996
49998 1
50002 1
49998 2
50002 2
49998 3
50002 3
49998 4
50002 4
49998 5
50002 5
49998 6
50002 6
49998 7
50002 7
49998 8
50002 8
49998 9
50002 9
49998 10
50002 10
49998 11
50002 11
49998 12
50002 12
49998 13
50002 13
49998 14
50002 14
49998 15
50002 15
49998 16
50002 16
49998 17
50002 17
49998...

result:

wrong answer Sum diagonals are not distinct