Dijkstra
-
택배백준알고리즘 2019. 9. 29. 20:41
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 #include #include #include #include using namespace std; int tc,n, d, c; vector map[20000]; int visit[20000]; int dist[20000]; int node, edge; int INF = 987654321; int mapp[200][200]..
-
최소비용 구하기백준알고리즘 2019. 9. 29. 01:12
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 #include #include #include #include using namespace std; class PAIR { public: int x, y; PAIR(int x, int y) { this->x = x; this->y = y; } }; int tc,n, d, c; vector map[20000]; int vis..
-
최단 경로백준알고리즘 2019. 9. 29. 00:16
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 #include #include #include #include using namespace std; class PAIR { public: int x, y; PAIR(int x, int y) { this->x = x; this->y = y; } }; int tc,n, d, c; vector map[20000]; int visit[20000]; /..
-
해킹백준알고리즘 2019. 9. 28. 23:34
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 #include #include #include #include #include using namespace std; int tc,n, d, c; vector map[10000]; long long visit[10000]; bool dist[10000]; vector vv; int v; int INF =..