結果

問題 No.22 括弧の対応
コンテスト
ユーザー niquni
提出日時 2016-10-04 21:53:19
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
RE  
実行時間 -
コード長 2,409 bytes
コンパイル時間 492 ms
コンパイル使用メモリ 55,980 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-21 16:51:53
合計ジャッジ時間 3,454 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 4 RE * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
using namespace std;

typedef struct parent {
    int num;
    char prt;
    parent *prev;
    parent *next;
} parent;

parent *cons(parent *tail ,int num) {
    parent *n = new parent;
    tail->next = n;
    n->prev = tail;
    n->num = num;
    cin >> n->prt;
    return n;
}

/*void deleteGavage(parent *gavage) {
    parent *tmpgvg = gavage;
    delete tmpgvg->next;
    delete tmpgvg;
}*/

void connectG_list(parent *gtail, parent *g) {
    gtail->next = g;
    g->prev = gtail;
    gtail = g;
    gtail->next = NULL;
}

int main() {
    int n, k;
    char *c;
    parent *p, *head, *tail, *search, *ghead, *gtail;

    cin >> n >> k;

    head = new parent;
    head->num = 1;
    cin >> head->prt;
    head->prev = NULL;
    tail = head;
    for (int i = 2; i <= n; i++) {
        tail = cons(tail, i);
    }
    tail->next = NULL;

    /*while (head != NULL) {
        cout << head->prt;
        head = head->next;
        //cout << "d\n";
        //delete head;
    }*/
    //cout << "\n";
    ghead = new parent;

    ghead->next = NULL;
    ghead->prev = NULL;
    parent *temp0;
    int flag = 0;
    while (flag == 0) {
        search = head;
        while (search != NULL)  {
            if ((search->prt == '(') && (search->next->prt == ')')) {
                if (search->num == k) {
                    cout << search->next->num << "\n";
                    flag = 1;
                }
                else if (search->next->num == k) {
                    cout << search->num << "\n";
                    flag = 1;
                }
                else {
                    //if (search == head) {

                        //deleteGavage(search);

                    //}
                    //else {
                        search->prev->next = search->next->next;
                        search->next->next->prev = search->prev;
                        temp0 = search;
                        delete temp0->next;
                        delete temp0;
                    //}
                    //break;
                }
                break;
            }
            search = search->next;
        }
    }
    //cout << "ok\n";
    parent *temp;
    /*while (ghead != NULL) {
        temp = ghead;
        ghead = ghead->next;
        delete temp;
    }*/
    while (head != NULL) {
        temp = head;
        head = head->next;
        delete temp;
    }


}
0