글 읽기 - 도대체 무엇이 문제인지 모르겠네요(파이썬)

wbjkwjj 3년 전 0

게시판에 올라온 예시들은 모두 통과합니다.

-바꾸기 전 최댓값을 구한다

-인접한 위치마다 바꾸어가며 최댓값을 구한다.

이 방법으로 코드를 짰는데

무엇이 잘못되었는지 모르겠네요

많은 지적 부탁드립니다

from sys import stdin
def check(a):#check maximum number of consecutive items in each row and column
    x=len(a)
    maxxx=0
    result=[]
    for i in range(x):
        case={}#numbers of each candy in row or column
        maxx=0
        for j in range(x):
            if a[i][j] not in case:
                case[a[i][j]]=1
            elif a[i][j] in case and a[i][j-1]==a[i][j]:
                case[a[i][j]]+=1
            else:
                case[a[i][j]]=1
        for k in case:
            if case[k]>maxx:
                maxx=case[k]
        if maxx>maxxx:
            maxxx=maxx
    for i in range(x):
        case={}#numbers of each candy in row or column
        maxx=0
        for j in range(x):
            if a[j][i] not in case:
                case[a[j][i]]=1
            elif a[j][i] in case and a[j-1][i]==a[j][i]:
                case[a[j][i]]+=1
            else:
                case[a[j][i]]=1
        for k in case:
            if case[k]>maxx:
                maxx=case[k]
        if maxx>maxxx:
            maxxx=maxx
    return maxxx
def hcheck(y,x,c):#check if horizontally switched
    case={}
    maxx=0
    for j in range(n):
        if c[y][j] not in case:
            case[c[y][j]]=1
        elif c[y][j] in case and c[y][j-1]==c[y][j]:
            case[c[y][j]]+=1
        else:
            case[c[y][j]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    case={}
    for j in range(n):
        if c[j][x] not in case:
            case[c[j][x]]=1
        elif c[j][x] in case and c[j-1][x]==c[j][x]:
            case[c[j][x]]+=1
        else:
            case[c[j][x]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    case={}
    for j in range(n):
        if c[j][x+1] not in case:
            case[c[j][x+1]]=1
        elif c[j][x+1] in case and c[j-1][x+1]==c[j][x+1]:
            case[c[j][x+1]]+=1
        else:
            case[c[j][x+1]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    return maxx
def vcheck(y,x,c):#check if vertically switched
    case={}
    maxx=0
    for j in range(n):
        if c[y][j] not in case:
            case[c[y][j]]=1
        elif c[y][j] in case and c[y][j-1]==c[y][j]:
            case[c[y][j]]+=1
        else:
            case[c[y][j]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    case={}
    for j in range(n):
        if c[j][x] not in case:
            case[c[j][x]]=1
        elif c[j][x] in case and c[j-1][x]==c[j][x]:
            case[c[j][x]]+=1
        else:
            case[c[j][x]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    case={}
    for j in range(n):
        if c[y+1][j] not in case:
            case[c[y+1][j]]=1
        elif c[y+1][j] in case and c[y+1][j-1]==c[y+1][j]:
            case[c[y+1][j]]+=1
        else:
            case[c[y+1][j]]=1
    for k in case:
        if case[k]>maxx:
            maxx=case[k]
    return maxx
c=[]
n=int(stdin.readline())
for i in range(n):
    q=list(str(stdin.readline().rstrip()))
    c.append(q)
x=len(c)
y=len(c[0])
result=check(c)#there could be answer before switching
#result=0
def swaph(y,x):#switch horizontally
    global c
    c[y][x],c[y][x+1]=c[y][x+1],c[y][x]
def swapv(y,x):#swtich vertically
    global c
    c[y][x],c[y+1][x]=c[y+1][x],c[y][x]

for j in range(n-1):#vertically
    for i in range(n):
        swapv(j,i)#switch vertically
        chec=vcheck(j,i,c)
        if chec>result:
            result=chec
        swapv(j,i)#swap one more time to restore 

for j in range(n):#horizontally
    for i in range(n-1):
        swaph(j,i)#swtich horizontally
        chec=hcheck(j,i,c)
        if chec>result:
            result=chec
        swaph(j,i)#swap one more time to restore

print(result)

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

문제

문제

출처

ICPC

도대체 무엇이 문제인지 모르겠네요(파이썬)

wbjkwjj 3년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말