👉 문제 바로가기
\n큐(Queue) : 먼저 집어 넣은 데이터가 먼저 나오는 FIFO(First In First Oout)구조로 데이터를 저장하는 자료 구조먼저 queue에 1 ~ n 까지의 사람을 en_queue한다.
\n그리고 queue의 앞에서부터 k-1 번째까지 모든 사람을 dequeue 했다가 enqueue하고, k 번째 사람은 dequeue 후 result array(linear list)에 enqueue한다.
\nqueue가 빌 때까지 위의 과정을 반복하고, 마지막으로 result array를 출력한다.
\n#include <iostream>\n\ntemplate <typename T>\nstruct Node {\n\tT data;\n\tstruct Node *front;\n\tstruct Node *rear;\n};\n\ntemplate <typename T>\nclass Queue {\nprivate:\n\tNode<T> *head;\n\tNode<T> *tail;\n\tint size;\n\t\npublic:\n\tQueue() : head(nullptr), tail(nullptr) , size(0) {}\n\t~Queue() {\n\t\tif (this->head == nullptr)\n\t\t\treturn;\n\t\t\n\t\tNode<T> *cur = this->tail;\n\t\t\n\t\twhile (cur != nullptr) {\n\t\t\tcur = cur->front;\n\t\t\tdelete this->tail;\n\t\t\tthis->tail = cur;\n\t\t}\n\t\t\n\t\tthis->head = this->tail;\n\t}\n\t\n\tint get_size() {\n\t\treturn this->size;\n\t}\n\t\n\tbool is_empty() {\n\t\treturn this->head == nullptr ? true : false;\n\t}\n\t\n\tvoid en_queue(T value) {\n\t\tNode<T> *node = new Node<T>;\n\t\tnode->data = value;\n\t\tnode->front = nullptr;\n\t\tnode->rear = nullptr;\n\t\t\n\t\tif (is_empty()) // first push.\n\t\t\tthis->head = node;\n\t\telse {\n\t\t\tnode->front = this->tail;\n\t\t\tthis->tail->rear = node;\n\t\t}\n\t\t\n\t\tthis->tail = node;\n\t\t++size;\n\t}\n\t\n\tT de_queue() {\n\t\tif (is_empty()) // empty queue\n\t\t\treturn -1; // T type에 맞는 error code return.\n\t\telse {\n\t\t\tint pop_val = this->head->data;\n\t\t\t\n\t\t\tif (this->head == this->tail) { // queue with 1 element.\n\t\t\t\tdelete this->head;\n\t\t\t\tthis->head = this->tail = nullptr;\n\t\t\t}\n\t\t\telse { // queue with more than 2 elements.\n\t\t\t\tNode<T> *node = new Node<T>;\n\t\t\t\t\n\t\t\t\tnode = this->head->rear;\n\t\t\t\t\n\t\t\t\tdelete this->head;\n\t\t\t\t\n\t\t\t\tthis->head = node;\n\t\t\t\tthis->head->front = nullptr;\n\t\t\t}\n\t\t\t\n\t\t\t--size;\n\t\t\treturn pop_val;\n\t\t}\n\t}\n};\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(NULL); \n\tstd::cout.tie(NULL);\n\t\n\tint n, k, idx=0;\n\tint result[1000];\n\tQueue<int> queue;\n\t\n\tstd::cin >> n >> k;\n\t\n\tfor (int i = 1; i <= n; ++i)\n\t\tqueue.en_queue(i);\n\t\n\twhile (queue.get_size() > 0) {\n\t\tfor (int i = 0; i < k-1; ++i)\n\t\t\tqueue.en_queue(queue.de_queue());\n\t\t\n\t\tresult[idx++] = queue.de_queue();\n\t}\n\t\n\tstd::cout << \"<\";\n\tfor (int i = 0; i < n-1; ++i) {\n\t\tstd::cout << result[i] << \", \";\n\t}\n\tstd::cout << result[n-1] << \">\" << std::endl;\n\t\n\treturn 0;\n}