提出 #51107493

---

ソースコード 拡げる

#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;

    constexpr Num Inf = 1000000000000000000LL;
    struct Node {
        Num prev {-Inf};
        Num next {Inf};
    };

    Vec ns(n);
    for(auto&& a : ns) {
        is >> a;
    }

    std::map<Num, Node> lst;
    Node left_most {-Inf, ns.at(0)};
    Node right_most {ns.back(), Inf};
    lst[-Inf] = left_most;
    lst[Inf] = right_most;

    if (n == 1) {
        Node node;
        lst[ns.at(0)] = node;
    } else {
        for(Num i{0}; i<n; ++i) {
            Node node;
            if (i == 0) {
                node.next = ns.at(i+1);
            } else if ((i+1) == n) {
                node.prev = ns.at(i-1);
            } else {
                node.prev = ns.at(i-1);
                node.next = ns.at(i+1);
            }
            lst[ns.at(i)] = node;
        }
    }

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

        if (cmd == 1) {
            Num x, y;
            is >> x >> y;

            const auto next = lst[x].next;
            Node node {x, next};
            lst[y] = node;
            lst[x].next = y;
            lst[next].prev = y;
        } else {
            Num x;
            is >> x;

            const auto prev = lst[x].prev;
            const auto next = lst[x].next;
            lst[prev].next = next;
            lst[next].prev = prev;
            lst.erase(x);
        }
    }

    Vec ans;
    Num cur = -Inf;
    for(;;) {
        if (cur == Inf) {
            break;
        }

        if (cur != -Inf) {
            ans.push_back(cur);
        }

        cur = lst[cur].next;
    }

    const auto size = ans.size();
    for(size_t i{0}; i<size; ++i) {
        os << ans.at(i) << (((i+1)==size) ? '\n' : ' ');
    }
}

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

提出情報

ジャッジ結果