Little Jay

백준 1197번 https://www.acmicpc.net/problem/1197 #include #define endl '\n' #define pii pair using namespace std; int V, E; int a, b, c; bool visited[10001]; vector graph; priority_queue pq; int answer = 0; void prim(int i) { visited[i] = true; for (auto u : graph[i]) { if (!visited[u.second]) pq.push({u.first, u.second}); } while (!pq.empty()) { auto temp = pq.top(); pq.pop(); if (!visited[temp.se..

#include #define NUMBER 8 #define INF 987654321 using namespace std; int table[NUMBER][NUMBER] = { {0, 3, INF, INF, INF, INF, 2, 4}, {3, 0, 2, 4, INF ,INF , INF, INF}, {INF, 2, 0, 4, INF, 5, INF, INF}, {INF, 4, 4, 0, 2, 5, INF, INF}, {INF ,INF ,INF, 2, 0, INF, 3 , 3}, {INF, INF ,5 ,5 ,INF, 0, INF ,2}, {2, INF, INF, INF, 3, INF, 0, 2}, {4, INF, INF, INF, 3, 2, 2, 0} }; void printTable() { for (in..