게임 클라 개발

백준 2098 - 외판원 순회 (DP) 더보기 #include #include #include #include #include using namespace std; constexpr int MAX_CITY = 16; constexpr int INF = 987654321; int N; int cities[MAX_CITY][MAX_CITY]; int dp[1 N; bit_fullVisit =( 1 > cities[i][j]; //dp 계산 for (int i = 1; i < N; ++i) visitQ.emplace(0, 0, i); while (!visitQ.empty()) { VisitInfo info = visitQ.front(); visitQ.pop(); visit(info.bit_visit, info..

백준 1726 - 로봇 더보기 #include #include #include #include //#define _CRTDBG_MAP_ALLOC //#include //#include using namespace std; // Priority Queue 저장용 class Node { public: int x, y, dir, score; Node(int x, int y, int dir, int score) : x{ x }, y{ y }, dir{ dir }, score{ score } {} Node() = default; }; // Node 비교용 class CompareNode { public: bool operator() (Node a, Node b) { return a.score > b.score; ..