글 읽기 - 20061번 틀렸습니다 나옵니다

20163047 2년 전 0

시작하자마자 틀렸습니다ㅠㅠ 뭐가 이유일까요? 반례도 부탁드립니다!
from collections import deque
blue=deque([[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]]) #(c,r)=(y,x)
green=deque([[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]])#(r,c)=(x,y)
blue_n=deque([0,0,0,0,0,0])
green_n=deque([0,0,0,0,0,0])
block=[]
N=int(input())
for i in range(N):
    block.append(list(map(int,input().split())))
score=0
for t,x,y in block:
    for i in range(0,6):
        if t==1 and i==5 and green[i][y]==0:
            green[i][y] = 1
            green_n[i] += 1
            break
        elif t==1 and green[i][y]==0 and green[i+1][y]==1:
            green[i][y]=1
            green_n[i]+=1
            break
        elif (t==2 and green[i][y]==0 and green[i][y+1]==0) and i==5:
            green[i][y], green[i][y + 1] = 1, 1
            green_n[i] += 2
            break
        elif (t==2 and green[i][y]==0 and green[i][y+1]==0) and (green[i+1][y]==1 or green[i+1][y+1]==1):
            green[i][y],green[i][y+1]=1,1
            green_n[i] += 2
            break
        elif t==3 and i==5 and green[i][y]==0 :
            green[i-1][y],green[i][y]=1,1
            green_n[i] += 1
            green_n[i-1] += 1
            break
        elif t == 3 and i!=0 and green[i - 1][y] == 0 and green[i][y] == 0 and green[i+1][y] == 1:
            green[i - 1][y], green[i][y] = 1, 1
            green_n[i] += 1
            green_n[i - 1] += 1
            break
    for i in range(0,6):
        if t == 1 and i == 5 and blue[i][x] == 0:
            blue[i][x] = 1
            blue_n[i] += 1
            break
        elif t == 1 and blue[i][x] == 0 and blue[i + 1][x] == 1:
            blue[i][x] = 1
            blue_n[i] += 1
            break
        elif t==2 and i==5 and blue[i][x]==0 :
            blue[i-1][x],blue[i][x]=1,1
            blue_n[i] += 1
            blue_n[i-1] += 1
            break
        elif t == 2 and i!=0 and blue[i - 1][y] == 0 and blue[i][x] == 0 and blue[i+1][x] == 1:
            blue[i - 1][x], blue[i][x] = 1, 1
            blue_n[i] += 1
            blue_n[i - 1] += 1
            break

        elif (t==3 and blue[i][x]==0 and blue[i][x+1]==0) and i==5:
            blue[i][x], blue[i][x + 1] = 1, 1
            blue_n[i] += 2
            break
        elif (t==3 and blue[i][x]==0 and blue[i][x+1]==0) and (blue[i+1][x]==1 or blue[i+1][x+1]==1):
            blue[i][x],blue[i][x+1]=1,1
            blue_n[i] += 2
            break

    for i in range(2,6):
        if green[i]==[1,1,1,1]:
            green=list(green)
            green_n=list(green_n)
            green.pop(i)
            green_n.pop(i)
            green=deque(green)
            green_n=deque(green_n)
            green.appendleft([0,0,0,0])
            green_n.appendleft(0)
            score+=1
        if blue[i]==[1,1,1,1]:
            blue=list(blue)
            blue_n=list(blue_n)
            blue.pop(i)
            blue_n.pop(i)
            blue=deque(blue)
            blue_n=deque(blue_n)
            blue.appendleft([0, 0, 0, 0])
            blue_n.appendleft(0)
            score += 1

    flag_b_0 = False
    flag_b_1 = False
    flag_g_0=False
    flag_g_1=False
    if 1 in blue[0]:
        flag_b_0=True
    if 1 in blue[1]:
        flag_b_1 = True
    if 1 in green[0]:
        flag_g_0 = True
    if 1 in green[1]:
        flag_g_1 = True
    if flag_b_0 and flag_b_1:
        blue.pop()
        blue.pop()
        blue_n.pop()
        blue_n.pop()
        blue_n.appendleft(0)
        blue_n.appendleft(0)
        blue.appendleft([0, 0, 0, 0])
        blue.appendleft([0, 0, 0, 0])
    elif flag_b_0 or flag_b_1:
        blue.pop()
        blue_n.pop()
        blue_n.appendleft(0)
        blue.appendleft([0, 0, 0, 0])

    if flag_g_0 and flag_g_1:
        green.pop()
        green.pop()
        green_n.pop()
        green_n.pop()
        green_n.appendleft(0)
        green_n.appendleft(0)
        green.appendleft([0, 0, 0, 0])
        green.appendleft([0, 0, 0, 0])
    elif flag_g_0 or flag_g_1:
        green.pop()
        green_n.pop()
        green_n.appendleft(0)
        green.appendleft([0, 0, 0, 0])

print(score)
print(sum([sum(green_n),sum(blue_n)]))
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

20061번 틀렸습니다 나옵니다

20163047 2년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
