QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#405130#3002. Busy BoardLspeedRE 0ms0kbPython32.1kb2024-05-05 11:49:102024-05-05 11:49:21

Judging History

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

  • [2024-05-05 11:49:21]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-05-05 11:49:10]
  • 提交

answer

n, m = map(int, input().split())
b = []
for i in range(n):
    b.append(input())

g = [['.' for _ in range(m)] for k in range(n)]

ct1 = 0
ct2 = 0

for i in range(n):
    for j in range(m):
        g[i][j] = b[i][j]
        if g[i][j] == 'X':
            ct1 += 1

b = []

for i in range(n):
    b.append(input())

t = [['.' for _ in range(m)] for k in range(n)]

for i in range(n):
    for j in range(m):
        t[i][j] = b[i][j]
        if t[i][j] == 'X':
            ct2 += 1

if ct1 == n*m:
    if ct2 == n*m:
        print(1)
    else:
        print(0)
elif ct2 == 0:
    if ct1 == 0:
        print(1)
    else:
        print(0)
else:
    c = [1 for i in range(m)]
    r = [1 for i in range(n)]
    # print(len(r),len(c))

    for i in range(n):
        ct = 0
        for j in range(m):
            if t[i][j] == 'X':
                ct += 1
        if ct > 1:
            r[i] = 0
            for j in range(m):
                if t[i][j] == 'X':
                    c[j] = 0

    for j in range(m):
        ct = 0
        for i in range(n):
            if t[i][j] == 'X':
                # print(i,j)
                ct += 1
        if ct > 1:
            # print(j,m,n,ct)
            c[j] = 0
            for i in range(n):
                if t[i][j] == 'X':
                    r[i] = 0

    check = True

    # if sum(c) == 0 or sum(r) == 0:
    #     for i in range(n):
    #         for j in range(m):
    #             if t[i][j] != g[i][j]:
    #                 check = False

    sum = 0
    ori = 0
    for i in range(n):
        for j in range(m):
            if c[j] != 1 and r[i] != 1:
                check = check and (t[i][j] == g[i][j])
            else:
                if t[i][j] == 'X':
                    sum += 1
                if g[i][j] == 'X':
                    ori += 1

    if ori == sum(c) * sum(r):
        for i in range(n):
            for j in range(m):
                check = check and (t[i][j] == g[i][j])
    if ori > 0:
        check = check and (sum > 0)

    if check:
        print(1)
    else:
        print(0)

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Dangerous Syscalls

input:

769 998
OOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXOOOOOOOOOOOOOOOOOOOO...

output:


result: