QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#263747#5101. Crystal CrosswindjuampiWA 15ms9040kbPython31.4kb2023-11-25 05:44:272023-11-25 05:44:28

Judging History

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

  • [2023-11-25 05:44:28]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:9040kb
  • [2023-11-25 05:44:27]
  • 提交

answer

def doit(x, y):
    ch = g[y][x] if (1 <= x <= X and 1 <= y <= Y) else '.'
    if not ch:
        return
    i = 0
    for i in range(N):
        x2 = x + (wm[i] if ch == '.' else -wm[i])
        y2 = y + (wn[i] if ch == '.' else -wn[i])
        if 1 <= x2 <= X and 1 <= y2 <= Y and not g[y2][x2]:
            g[y2][x2] = ch
            doit(x2, y2)

while True:
    try:
        X, Y, N = map(int, input().split())
        g = [['.' for _ in range(X + 1)] for _ in range(Y + 1)]
        wm = wn = [0] * N
        i = 0
        for i in range(N):
            line = input().split()
            wm[i] = int(line[0])
            wn[i] = int(line[1])
            B = int(line[2])
            j = 0
            for j in range(B):
                x = int(line[2+j])
                y = int(line[2+j+1])
                g[y][x] = '#'
                x2, y2 = x - wm[i], y - wn[i]
                if 1 <= x2 <= X and 1 <= y2 <= Y:
                    g[y2][x2] = '.'

        for y in range(-Y, 2 * Y + 1):
            for x in range(-X, 2 * X + 1):
                doit(x, y)

        for y in range(1, Y + 1):
            for x in range(1, X + 1):
                print(g[y][x] if g[y][x] else '.', end='')
            print()
        print()

        for y in range(1, Y + 1):
            for x in range(1, X + 1):
                print(g[y][x] if g[y][x] else '#', end='')
            print()

    except EOFError:
        break

详细

Test #1:

score: 0
Wrong Answer
time: 15ms
memory: 9040kb

input:

4 1 1
0 1 2 1 1 3 1

output:

##..

##..

result:

wrong answer 1st lines differ - expected: '#.#.', found: '##..'