글 읽기 - 질문글에 올라온 반례는 전부 정답인데 틀렸다고 나와요

t98339 2년 전 0

제가 반례는 어찌어찌 전부다 맞췄는데 틀렸다고 나오네요..

import sys
import copy

testcase = int(sys.stdin.readline())


def scan(f, mx, my):
    global A
    global B
    global C
    global D
    
    t = 0
    reset = [0]*mx
    find = [0]*100
    second = [0]*mx
    li = 0
    
    for dx in range(0,mx,1):
        for dy in range(0,my,1):
            if L[dy][dx] == '.':
                t += 1
        f[dx] = t
        t = 0
        
    for dx in range(0,mx,2):
        for dy in range(0,my,1):
            if A[dy][dx] == '.':
                got(A,my,mx,dy,dx)
    for dy in range(0,my,1):
        for dx in range(0,mx,1):
            if A[dy][dx] == '.':
                find[li] += 1
    li += 1
    
    
    for dx in range(1,mx,2):
        for dy in range(0,my,1):
            if C[dy][dx] == '.':
                got(C,my,mx,dy,dx)
                
    for dy in range(0,my,1):
        for dx in range(0,mx,1):
            if C[dy][dx] == '.':
                find[li] += 1
    li += 1
    
    
    
    for dz in range(0,mx,1):
        reset = [0]*mx
        reset = f[:]
        del reset[dz]
        for dt in range(0,mx,2):
            if dt >= len(reset):
                break
            second[dz] += reset[dt]
            
    for i in range(0,mx,1):
        if second[i] == max(second):
            a = i
    
            for dz in range(0,my,1):
                del B[dz][a]
            for dx in range(0,mx-1,2):
                for dy in range(0,my,1):
                    if B[dy][dx] == '.':
                        got(B,my,mx,dy,dx)
                
            for dy in range(0,my,1):
                for dx in range(0,mx-1,1):
                    if B[dy][dx] == '.':
                        find[li] += 1        
            li += 1
        B = copy.deepcopy(L)                   
                
                
    
    second = [0]*mx
       
       
       
    for dz in range(1,mx,1):
        reset = [0]*mx
        reset = f[:]
        del reset[dz]
        for dt in range(0,mx,2):
            if dt >= len(reset):
                break
            second[dz] += reset[dt]
    
    for i in range(0,mx,1):
        if second[i] == max(second):
            b = i
            
            for dz in range(0,my,1):
                del D[dz][b]
            for dx in range(0,mx-1,2):
                for dy in range(0,my,1):
                    if D[dy][dx] == '.':
                        got(D,my,mx,dy,dx)
            
            for dy in range(0,my,1):
                for dx in range(0,mx-1,1):
                    if D[dy][dx] == '.':
                        find[li] += 1
            li += 1
        D = copy.deepcopy(L)
    
    
    return max(find)
    
        

def got(L1, my1, mx1, ay, ax):
    for dy in range(-1,2,1):
        for dx in range(-1,2,1):
            if ay + dy < 0 or ax + dx < 0 or ay + dy == my1 or ax + dx == mx1:
                continue
            else:
                if dx + (dy*3) == -1 or dx + (dy*3) == -2 or dx + (dy*3) == -4 or dx + (dy*3) == 1 or dx + (dy*3) == 2 or dx + (dy*3) == 4:
                    try:
                        L1[ay+dy][ax+dx] = 'x'
                    except:
                        continue
    
while 1:
    my, mx = map(int, sys.stdin.readline().split())
    L = [['']*mx for i in range(0,my,1)]
    A = [['']*mx for i in range(0,my,1)]
    B = [['']*mx for i in range(0,my,1)]
    C = [['']*mx for i in range(0,my,1)]
    D = [['']*mx for i in range(0,my,1)]
    f = [0]*mx

    
    for dy in range(0,my,1):
        arr = input()
        list(arr)       
        for dx in range(0,mx,1):
            L[dy][dx] = arr[dx]
            A[dy][dx] = arr[dx]
            B[dy][dx] = arr[dx]
            C[dy][dx] = arr[dx]
            D[dy][dx] = arr[dx]
            
            
    print(scan(f, mx, my))
            
        
    
    testcase -= 1
    if testcase == 0:
        break

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

질문글에 올라온 반례는 전부 정답인데 틀렸다고 나와요

t98339 2년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말