회원가입
로그인
Toggle navigation
문제
문제
전체 문제
문제 출처
단계별로 풀어보기
알고리즘 분류
추가된 문제
문제 순위
문제
푼 사람이 한 명인 문제
아무도 못 푼 문제
최근 제출된 문제
최근 풀린 문제
랜덤
출처
ICPC
Olympiad
한국정보올림피아드
한국정보올림피아드시․도지역본선
전국 대학생 프로그래밍 대회 동아리 연합
대학교 대회
카카오 코드 페스티벌
Coder's High
ICPC
Regionals
World Finals
Korea Regional
Africa and the Middle East Regionals
Europe Regionals
Latin America Regionals
North America Regionals
South Pacific Regionals
문제집
대회
2
채점 현황
랭킹
게시판
그룹
더 보기
재채점 기록
블로그
강의
실험실
도움말
BOJ Stack
BOJ Book
전체
공지
자유
질문
오타/오역/요청
게시판 공지
홍보
업데이트
solved.ac
글쓰기
질문 도움말
자주묻는 질문
[파이썬] 메모리초과
5719번 - 거의 최단 경로
care9000
4년 전
0
메모리 초과 해결 방안 없을까여?
import sys sys.stdin = open('5719_거의_최단_경로.txt') from sys import stdin input = stdin.readline import collections def find_short_distance(location, distance, road): global short_distance, short_distance_list q = collections.deque([]) q.append([location, distance, road]) while len(q): location, distance, road = q.popleft() if location == D: if distance < short_distance: short_distance = distance short_distance_list = [road] elif distance == short_distance: short_distance_list.append(road) elif distance > short_distance: pass else: for i in range(N): if roads[location][i] > 0 and str(i) not in road: q.append([i, distance + roads[location][i], road + str(i)]) def find_2_distance(location, distance): global result q = collections.deque([]) q.append([location, distance, str(location)]) while len(q): location, distance, road = q.popleft() if location == D: if distance < result: result = distance elif distance > result: pass else: for i in range(N): if roads[location][i] > 0 and str(i) not in road: q.append([i, distance + roads[location][i], road + str(i)]) while 1: N, M = map(int, input().split()) if N == 0 and M == 0: break S, D = map(int, input().split()) dummys = [list(map(int, input().split())) for _ in range(M)] roads = [[0 for _ in range(N)] for _ in range(N)] for dummy in dummys: roads[dummy[0]][dummy[1]] = dummy[2] visited = [0 for _ in range(N)] visited[S] = 1 short_distance = 987654321 short_distance_list = [] find_short_distance(S, 0, str(S)) for i in range(len(short_distance_list)): for j in range(len(short_distance_list[i]) - 1): roads[int(short_distance_list[i][j])][int(short_distance_list[i][j + 1])] = 0 result = 987654321 find_2_distance(S, 0) if result == 987654321: print(-1) else: print(result)
care9000
4년 전
0
이코드도 왜 메모리 초과인지 몰겠네요 ㅠㅠ
from sys import stdin input = stdin.readline import collections def find_short_distance(location, distance, road): global short_distance, short_distance_list q = collections.deque([]) q.append([location, distance, road]) while len(q): location, distance, road = q.popleft() if location == D: if distance < short_distance: short_distance = distance short_distance_list = [road] elif distance == short_distance: short_distance_list.append(road) elif distance > short_distance: pass else: for i in range(len(roads[location])): if roads[location][i][1] > 0 and str(roads[location][i][0]) not in road: q.append([roads[location][i][0], distance + roads[location][i][1], road + str(roads[location][i][0])]) def find_2_distance(location, distance): global result q = collections.deque([]) q.append([location, distance, str(location)]) while len(q): location, distance, road = q.popleft() if location == D: if distance < result: result = distance elif distance > result: pass else: for i in range(len(roads[location])): if roads[location][i][1] > 0 and str(roads[location][i][0]) not in road: q.append([roads[location][i][0], distance + roads[location][i][1], road + str(roads[location][i][0])]) while 1: N, M = map(int, input().split()) if N == 0 and M == 0: break S, D = map(int, input().split()) dummys = [list(map(int, input().split())) for _ in range(M)] roads = [[] for _ in range(N)] for dummy in dummys: roads[dummy[0]].append([dummy[1], dummy[2]]) short_distance = 987654321 short_distance_list = [] find_short_distance(S, 0, str(S)) for i in range(len(short_distance_list)): for j in range(len(short_distance_list[i]) - 1): tem = int(short_distance_list[i][j]) find = int(short_distance_list[i][j + 1]) for k in range(len(roads[tem])): if roads[tem][k][0] == find: roads[tem][k][1] = 0 result = 987654321 find_2_distance(S, 0) if result == 987654321: print(-1) else: print(result)
댓글을 작성하려면
로그인
해야 합니다.
care9000 4년 전
메모리 초과 해결 방안 없을까여?