Submission #66972909

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/*
T = 1
def init():
    global T
    #T = _I()
def solve():
    N,Q = _M()
    svs = [[-1,""]]
    ind = 0
    same = [[0,""] for i in _R(N)]
    for i in _R(Q):
        q = list(_SS())
        if q[0] == "1":
            same[int(q[1])-1] = [ind,""]
        if q[0] == "2":
            same[int(q[1])-1][1] += q[2]
        if q[0] == "3":
            svs.append(same[int(q[1])-1])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

/*
T = 1

def init():
    global T
    #T = _I()


def solve():
    N,Q = _M()
    svs = [[-1,""]]
    ind = 0
    same = [[0,""] for i in _R(N)]
    for i in _R(Q):
        q = list(_SS())
        if q[0] == "1":
            same[int(q[1])-1] = [ind,""]
        if q[0] == "2":
            same[int(q[1])-1][1] += q[2]
        if q[0] == "3":
            svs.append(same[int(q[1])-1])
            ind += 1
    a = []
    while ind != -1:
        a.append(svs[ind][1])
        ind = svs[ind][0]
    print(*a[::-1],sep="")
*/
//変換後普通に改良
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;

    vector<pair<int, vector<string>>> svs = {{-1, {}}};
    int ind = 0;

    vector<pair<int, vector<string>>> same(N, {0, {}});

    for (int i = 0; i < Q; ++i) {
        string op;
        cin >> op;

        if (op == "1") {
            int x;
            cin >> x;
            same[x - 1] = {ind, {}};
        }
        else if (op == "2") {
            int x;
            string s;
            cin >> x >> s;
            same[x - 1].second.push_back(s);
        }
        else if (op == "3") {
            int x;
            cin >> x;
            svs.push_back(same[x - 1]);
            ind++;
        }
    }

    vector<vector<string>> a;
    while (ind != -1) {
        a.push_back(svs[ind].second);
        ind = svs[ind].first;
    }

    reverse(a.begin(), a.end());
    string ans;
    for (auto& v : a) {
        for (auto& s : v) {
            ans += s;
        }
    }
    cout << ans << '\n';

    return 0;
}

Submission Info

Judge Result