코드#include #include #include #include using namespace std;typedef long long ll;const ll INF = 987654321;ll n, e, a, b, c, vo, vt, visited[808], res;vector> adj[808];ll dijkstra(ll s, ll e) { fill(visited, visited + 808, INF); priority_queue, vector>, greater>> pq; pq.push(make_pair(0, s)); visited[s] = 0; while(!pq.empty()) { int dist = pq.top().first; int here = pq.top().second; pq.pop(); i..
1504번
코드 import sys, heapq # 우선순위 큐를 이용한 다익스트라를 구현할 용도 input = sys.stdin.readline INF = 987654321 # 무한대 n,m = map(int,input().split()) graph = [[] for _ in range(n+1)] for _ in range(m): a,b,c = map(int,input().split()) graph[a].append((b,c)) # 양방향 길 graph[b].append((a,c)) v1,v2 = map(int,input().split()) # 꼭 들러야 할 길 def dijkstra(start,end): # 다익스트라 알고리즘 queue = [(0,start)] visited = [INF] * (n+1) # v..
