알고리즘/다익스트라3 다익스트라 || (더블릿) _ 최소 힙 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101#include #include #include using namespace std; typedef struct node { int len, v1, v2;}; struct cmp { bool operator()(node a, node b) { return a.len > b.len; }}; int main() { int n1, n2; scanf("%d %d", &.. 2019. 5. 21. silver cow party (더블릿) 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586#include #include #include using namespace std; typedef pair Pair; priority_queue pq;priority_queue pq2; int main() { int n, m, x; scanf("%d %d %d", &n, &m, &x); vector adj(n + 1); vector adjR(n + 1); vector visit(n + 1, 0); vector vis.. 2019. 5. 18. 다익스트라 최단거리 (더블릿) 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465#include #include #include #include using namespace std; typedef pair Pair; priority_queue pq; int main() { int n, m, s; scanf("%d %d %d", &n, &m, &s); vector dist(n+1, 30000000); vector visit(n+1, 0); vector adj(n+1); vector path(n + 1); for (int i = 0; i 2019. 5. 18. 이전 1 다음