글 읽기 - 테스트 케이스는 다 맞는데 시작하자마자 틀렸다고 나옵니다

mekido 4년 전 0

문제에 있는 테스트케이스 이외에도 질문게시판에 있는 모든 테스트 케이스를 돌려도 맞는데, 실제로 코드를 돌려보면 바로 틀렸다고 나오네요 .. 혹시 어느 부분이 문제인지 좀 알 수 있을까요 ?

import sys

N, M, T = map(int, sys.stdin.readline().split())

circle = []
for _ in range(N):
    circle.append(list(map(int, sys.stdin.readline().split())))

info = []
for _ in range(T):
    info.append(list(map(int, sys.stdin.readline().split())))

def get_number(x, N):
    num_lst = []
    for i in range(1,N+1):
        if x * i <= N :
            num_lst.append(x*i - 1 ) 
    return num_lst

def rotate_clock(idx, k):
    for _ in range(k):
        tmp = circle[idx].pop()
        circle[idx].insert(0, tmp)

def rotate_anticlock(idx, k):
    for _ in range(k):
        tmp = circle[idx].pop(0)
        circle[idx].append(tmp)

def check(idx, M, location_lst):
    for i in range(M):
        if i == 0: 
            if circle[idx][0] == circle[idx][1]:
                if circle[idx][0] != -1 and [idx, 0] not in location_lst:
                    location_lst.append([idx,0])
                if circle[idx][1] != -1 and [idx, 1] not in location_lst:
                    location_lst.append([idx,1])
            
            if circle[idx][0] == circle[idx][M-1]:
                if circle[idx][0] != -1 and [idx, 0] not in location_lst:
                    location_lst.append([idx, 0])
                if circle[idx][3] != -1 and [idx, M-1] not in location_lst:
                    location_lst.append([idx, M-1])
        
        elif 0<i and i<M-1:
            if circle[idx][i] == circle[idx][i+1]:
                if circle[idx][i] != -1 and [idx,i] not in location_lst:
                    location_lst.append([idx, i])
                if circle[idx][i+1] !=-1 and [idx,i+1] not in location_lst:
                    location_lst.append([idx, i+1])
                    
            if circle[idx][i] == circle[idx][i-1]:
                if circle[idx][i] != -1 and [idx, i] not in location_lst:
                    location_lst.append([idx, i])
                if circle[idx][i-1] != -1 and [idx, i-1] not in location_lst:
                    location_lst.append([idx, i-1])
        
        elif i == M-1:
            if circle[idx][0] == circle[idx][i]:
                if circle[idx][0] != -1 and [idx, 0] not in location_lst:
                    location_lst.append([idx,0])
                if circle[idx][i] != -1 and [idx, i] not in location_lst:
                    location_lst.append([idx,i])
            
            if circle[idx][i] == circle[idx][i-1]:
                if circle[idx][i] != -1 and [idx, i] not in location_lst:
                    location_lst.append([idx, 0])
                if circle[idx][i-1] != -1 and [idx, i-1] not in location_lst:
                    location_lst.append([idx, i-1])


def check_all(idx, M, location_lst):
    for i in range(M):
        if circle[idx][i] ==  circle[idx+1][i]:
            if circle[idx][i] != -1 and [idx, i] not in location_lst:
                location_lst.append([idx, i])
            if circle[idx+1][i] != -1 and [idx+1, i] not in location_lst:
                location_lst.append([idx+1, i])
    
    for i in range(M):
        if circle[idx][i] == circle[idx-1][i]:
            if circle[idx][i] != -1 and [idx, i] not in location_lst:
                location_lst.append([idx, i])
            if circle[idx-1][i] != -1 and [idx-1, i] not in location_lst:
                location_lst.append([idx-1,i])
                

def check_last(idx, M, location_lst):
    for i in range(M):
        if circle[idx][i] == circle[idx-1][i]:
            if circle[idx][i] != -1 and [idx, i] not in location_lst:
                location_lst.append([idx, i])
            if circle[idx-1][i] != -1 and [idx-1, i] not in location_lst:
                location_lst.append([idx-1,i])
                

def to_zero(location_lst):
    for i,j in location_lst:
        circle[i][j] = -1

def add():
    result = 0
    for i in range(N):
        for j in range(M):
            if circle[i][j] != -1:
                result += circle[i][j]
    return result
def caclulate(result):
    count = 0
    for i in range(N):
        for j in range(M):
            if circle[i][j] != -1:
                count+=1
    avg = result / count
    
    for i in range(N):
        for j in range(M):
            if circle[i][j] > avg:
                circle[i][j] -=1
            elif circle[i][j] < avg:
                circle[i][j] +=1
                
for t in range(T):
    x = info[t][0]
    d = info[t][1]
    k = info[t][2]
    
    num_lst = get_number(x, N)
    for num in num_lst:
        if d == 0:
            rotate_clock(num, k)
        elif d == 1:
            rotate_anticlock(num, k)
    
    location_lst = []
    for i in range(N):
        if i == 0:
            check(i, M, location_lst)
        elif 0<i and i < N-1:
            check(i, M, location_lst)
            check_all(i, M, location_lst)
        elif i == N-1:
            check(i, M, location_lst)
            check_last(i, M, location_lst)

    to_zero(location_lst)
    result = add()
            
    if not location_lst:
        caclulate(result)

print(result)
                
                  
                

paa0609 4년 전 0

42번줄에 오타가 있네요

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

문제

문제

출처

ICPC

테스트 케이스는 다 맞는데 시작하자마자 틀렸다고 나옵니다

mekido 4년 전 0

paa0609 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말