Submission #51082044

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    Vec ns(n);
    std::list<Num> lst;
    for(Num i{0}; i<n; ++i) {
        Num a;
        is >> a;
        ns.at(i) = a;
        lst.push_back(a);
    }

    auto it = lst.begin();
    std::map<Num, decltype(it)> elements;
    for(Num i{0}; i<n; ++i) {
        elements[ns.at(i)] = it;
        ++it;
    }

    Num q {0};
    is >> q;
    while(q-- > 0) {
        Num cmd;
        is >> cmd;

        if (cmd == 1) {
            Num x, y;
            is >> x >> y;
            auto it = elements[x];
            ++it;
            elements[y] = lst.insert(it, y);
        } else {
            Num x;
            is >> x;
            auto it = elements[x];
            lst.erase(it);
            elements.erase(x);
        }
    }

    it = lst.begin();
    if (it == lst.end()) {
        os << "\n";
        return;
    }

    for(;;) {
        os << *it;
        ++it;
        if (it == lst.end()) {
            os << "\n";
            break;
        }
        os << " ";
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result