QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#216841#7178. Bishopscardinal_city#WA 153ms47412kbPython3769b2023-10-16 01:59:062023-10-16 01:59:06

Judging History

你现在查看的是最新测评结果

  • [2023-10-16 01:59:06]
  • 评测
  • 测评结果:WA
  • 用时:153ms
  • 内存:47412kb
  • [2023-10-16 01:59:06]
  • 提交

answer

[n, m] = map(int, input().split())

if n % m == 0 or m % n == 0:
    print(n + m - 2)
else:
    print(n + m - 1)

def get_pairs(a, b):
    if a > b:
        return [(t[1], t[0]) for t in get_pairs(b, a)]
    elif a == 1:
        return [(1, k) for k in range(1, b + 1)]
    elif a == 0:
        return []
    elif b % a == 0:
        num = b // a
        ans = [(k, 1 + a * x) for k in range(1, a + 1) for x in range(num)]
        ans += [(k, b) for k in range(2, a)]
        return ans
    else:
        num = b // a
        ans = [(k, 1 + a * x) for k in range(1, a + 1) for x in range(num)]
        ans += [(t[0], t[1] + a * num) for t in get_pairs(a, b % a)]
        return ans

ans = get_pairs(n, m)
for t in ans:
    print(t[0], t[1])

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 15ms
memory: 9172kb

input:

2 5

output:

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

result:

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

Test #2:

score: 0
Accepted
time: 4ms
memory: 8996kb

input:

5 5

output:

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

result:

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

Test #3:

score: 0
Accepted
time: 115ms
memory: 30256kb

input:

100000 100000

output:

199998
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

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

Test #4:

score: 0
Accepted
time: 153ms
memory: 47412kb

input:

100000 99999

output:

199998
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

result:

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

Test #5:

score: 0
Accepted
time: 102ms
memory: 35744kb

input:

100000 50000

output:

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

result:

ok n: 100000, m: 50000, bishops: 149998

Test #6:

score: -100
Wrong Answer
time: 68ms
memory: 19592kb

input:

1 100000

output:

99999
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 6...

result:

wrong answer Participant's answer is not optimal (99999 < 100000)