QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#174248#7178. Bishopsucup-team1265#WA 292ms39092kbC++201.9kb2023-09-10 05:50:042023-09-10 05:50:04

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 5

output:

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

result:

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

Test #2:

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

input:

5 5

output:

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

result:

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

Test #3:

score: 0
Accepted
time: 292ms
memory: 27000kb

input:

100000 100000

output:

199998
1 1
1 100000
2 1
99999 100000
2 100000
99999 1
3 1
99998 100000
3 100000
99998 1
4 1
99997 100000
4 100000
99997 1
5 1
99996 100000
5 100000
99996 1
6 1
99995 100000
6 100000
99995 1
7 1
99994 100000
7 100000
99994 1
8 1
99993 100000
8 100000
99993 1
9 1
99992 100000
9 100000
99992 1
10 1
999...

result:

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

Test #4:

score: -100
Wrong Answer
time: 227ms
memory: 39092kb

input:

100000 99999

output:

199998
1 1
100000 99998
1 3
100000 99996
1 5
100000 99994
1 7
100000 99992
1 9
100000 99990
1 11
100000 99988
1 13
100000 99986
1 15
100000 99984
1 17
100000 99982
1 19
100000 99980
1 21
100000 99978
1 23
100000 99976
1 25
100000 99974
1 27
100000 99972
1 29
100000 99970
1 31
100000 99968
1 33
10000...

result:

wrong answer Sum diagonals are not distinct