lickelon.log

문제 링크 : boj.kr/5972난이도 : G5태그 : 다익스트라코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;vector dijkstra(ll start, vector> &edge) { vector d(edge.size(), INF); priority_queue> _pq; _pq.push({0, start}); while(!_pq.empty()) { ll dist = -_pq.top().first; ll ..

문제 링크 : boj.kr/22865난이도 : G4태그 : 다익스트라코드#include #define all(x) (x).begin(), (x).end()#define INF 1e18using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;vector dijkstra(ll start, vector> &edge) { vector d(edge.size(), INF); priority_queue> _pq; _pq.push({0, start}); while(!_pq.empty()) { ll dist = -_pq.top().first; ll curr ..

문제 링크 : boj.kr/13424난이도 : G4태그 : 다익스트라코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T; cin >> T; while(T--) { int n, m; cin >> n >> m; vector> edge(n+1); for(int i = 0;..

문제 링크 : boj.kr/1916난이도 : G5태그 :다익스트라코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector> edge(n+1); vector dist(n+1, INF); for(int i = 0; i > a >> b >> c; edge[a..