그랬었습니다

12345678910111213141516171819202122232425262728293031323334353637383940#include #include #include using namespace std; class AbsHeap {private: int num;public: AbsHeap(int num) : num(num) {}; int getNum() { return this->num; }}; bool operator>(AbsHeap h1, AbsHeap h2) { if (abs(h1.getNum()) == abs(h2.getNum())) return h1.getNum() > h2.getNum(); else return abs(h1.getNum()) > abs(h2.getNum());} int..

123456789101112131415#include int main() { int N, K; scanf("%d %d", &N, &K); int* cost = new int[N]; for (int i = 0; i

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657#include #include using namespace std; bool bfs(int** arr, int size) { bool* visited = new bool[size] { true, }; queue q; q.push(0); while (!q.empty()) { int now = q.front(); q.pop(); if (now == size - 1) return true; for (int i = 0; i

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667#include #include #include using namespace std; int arr[100][100][100]{ 0, };int visited[100][100][100]{ 0, };queue order; int bfs(int sizeH, int sizeN, int sizeM, int nu) { int max = 1; while (!order.empty()) { tuple now = order.front(); order.pop(); nu++; max = arr[get(n..

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859#include #include using namespace std; int bfs(int** arr, int** visited, int size, int x, int y) { queue order; order.push({ x, y }); int num = 0; visited[x][y] = 1; while (!order.empty()) { pair now = order.front(); order.pop(); num++; if (now.first + 1 = 0 && arr[now.first - 1][now.seco..

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include #include using namespace std; int bfs(int** arr, int sizeX, int sizeY) { queue order; int** visited = new int* [sizeX]; for (int i = 0; i

12345678910111213141516171819202122232425262728293031323334353637#include int isFilled(int** arr, int size, int x, int y) { int tmp = arr[x][y]; for (int i = 0; i

123456789101112131415161718192021222324252627282930313233343536#include int main() { int N, M; scanf("%d %d", &N, &M); int** arr = new int* [N + 1]; for (int i = 1; i

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include #include #include using namespace std; void dfs(bool** arr, bool* visited, int size, int start) { printf("%d ", start); visited[start] = true; for (int i = 1; i 0) { int pos = order.front(); order.pop(); printf("%d ", pos); for (int i = 1; i

12345678910111213141516171819202122232425#include #include using namespace std; int main() { int N, M, count = 0; string S; cin >> N >> M >> S; for (int j = 0; j