글 읽기 - [파이썬] 꼭 답변부탁드립니다. ㅠㅠ

coding_master 1년 전 0

게시판에 있는 반례들 다 입력해봤는데 다 맞는데 제출해보면 25%에서 틀렸다고 나옵니다. ㅠㅠ

from collections import deque
n = int(input())
for _ in range(n):
  q = deque()
  a,b = map(int,input().split())
  graph = []
  w = deque()
  for mm in range(b):
    k = list(input())
    for m in range(a):
      if k[m] == '*':
        q.append((mm,m))
      if k[m] == '@':
        w.append((mm,m))
    graph.append(k)
  for l in q:
    p,pp = l
    graph[p][pp] = 0
  def bfs_f():
    while q:
      x,y = q.popleft()
      dx = [1,-1,0,0]
      dy = [0,0,-1,1]
      for i in range(4):
        nx = x + dx[i]
        ny = y + dy[i]
        if 0 <= nx < b and 0 <= ny < a:
          if graph[nx][ny] == '.' or graph[nx][ny] == '@':
            q.append((nx,ny))
            graph[nx][ny] = graph[x][y] + 1
  bfs_f()
  visited = [[0]*a for _ in range(b)]
  result = False
  def bfs_b():
    global result
    t,tt = w[0]
    graph[t][tt] = 0
    visited[t][tt] = -1
    while w:
      x,y = w.popleft()
      dx = [1,-1,0,0]
      dy = [0,0,-1,1]
      for ii in range(4):
        nx = x + dx[ii]
        ny = y + dy[ii]
        if 0 <= nx < b and 0 <= ny < a:
          if graph[nx][ny] != '#':
            if graph[nx][ny] == '.':
              graph[nx][ny] = 10000
            if visited[nx][ny] > -1:
              if graph[x][y] + 1 >= graph[nx][ny]:
                visited[nx][ny] = -1
              elif graph[x][y]+1 < graph[nx][ny]:
                w.append((nx,ny))
                graph[nx][ny] = graph[x][y]+1
                visited[nx][ny] = -1

        else:
          result = True

          print(graph[x][y]+1)
          break
  bfs_b()
  if result == False:
    print('IMPOSSIBLE')

coding_master 1년 전 0

제가 실수를 했네요. ㅎㅎ

from collections import deque
n = int(input())
for _ in range(n):
  q = deque()
  a,b = map(int,input().split())
  graph = []
  w = deque()
  for mm in range(b):
    k = list(input())
    for m in range(a):
      if k[m] == '*':
        q.append((mm,m))
      if k[m] == '@':
        w.append((mm,m))
    graph.append(k)
  for l in q:
    p,pp = l
    graph[p][pp] = 0
  def bfs_f():
    while q:
      x,y = q.popleft()
      dx = [1,-1,0,0]
      dy = [0,0,-1,1]
      for i in range(4):
        nx = x + dx[i]
        ny = y + dy[i]
        if 0 <= nx < b and 0 <= ny < a:
          if graph[nx][ny] == '.' or graph[nx][ny] == '@':
            q.append((nx,ny))
            graph[nx][ny] = graph[x][y] + 1
  bfs_f()
  visited = [[0]*a for _ in range(b)]
  result = False
  def bfs_b():
    global result
    t,tt = w[0]
    graph[t][tt] = 0
    visited[t][tt] = -1
    while w:
      x,y = w.popleft()
      dx = [1,-1,0,0]
      dy = [0,0,-1,1]
      for ii in range(4):
        nx = x + dx[ii]
        ny = y + dy[ii]
        if 0 <= nx < b and 0 <= ny < a:
          if graph[nx][ny] != '#':
            if graph[nx][ny] == '.':
              graph[nx][ny] = 10000
            if visited[nx][ny] > -1:
              if graph[x][y] + 1 >= graph[nx][ny]:
                visited[nx][ny] = -1
              elif graph[x][y]+1 < graph[nx][ny]:
                w.append((nx,ny))
                graph[nx][ny] = graph[x][y]+1
                visited[nx][ny] = -1

        else:
          result = True

          print(graph[x][y]+1)
          break
      if result == True: # 실수한 부분
        break
  bfs_b()
  if result == False:
    print('IMPOSSIBLE')

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

문제

문제

출처

ICPC

[파이썬] 꼭 답변부탁드립니다. ㅠㅠ

coding_master 1년 전 0

coding_master 1년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말