BOJ 2605번 줄 세우기

BOJ : https://www.acmicpc.net/problem/2605

github : https://github.com/junho0956/Algorithm/blob/master/2605/2605/%EC%86%8C%EC%8A%A4.cpp

 

다음은 직접 list 를 구현하여 해결한 코드입니다.

 

#include <iostream>
using namespace std;
 
struct node {
    int num;
    node* first;
    node* back;
    bool r, b;
    
    node() {
        this->first = NULL, this->back = NULL;
        this->r = this->b = false;
    }
 
    void insert(node * np, int cnt, int ans) {
        node* p = np;
        if (cnt == 0) {
            node* newp = new node();
            p->first->back = newp;
            newp->first = p->first;
            newp->back = p;
            p->first = newp;
            newp->num = ans;
        }
        else {
            p->insert(p->first, cnt - 1, ans);
        }
    }
 
    void print_node(node* p) {
        if (p->b) return;
        cout << p->num << " ";
        p->print_node(p->back);
    }
};
 
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    
    node* root = new node();
    node* broot = new node();
    root->back = broot;
    broot->first = root;
    root->r = broot->b = true;
 
    int N; cin >> N;
 
    for (int i = 1; i <= N; i++) {
        int cnt; cin >> cnt;
        broot->insert(broot, cnt, i);
    }
 
    root->print_node(root->back);
    return 0;
}