Submission #73584554

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define double long double

using ll = long long;
using ull = unsigned long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VC = vector<char>;
using VVC = vector<VC>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VVVVI = vector<VVVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VVVVL = vector<VVVL>;
using VVVVVL = vector<VVVVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VT = vector<string>;
using VVT = vector<VT>;
//using P = pair<int, int>;

#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
//constexpr ll LINF = 8e18;
//constexpr int DX[] = {-1, -1, 0, 0, 1, 1};
//constexpr int DY[] = {-1, 0, -1, 1, 0, 1};
constexpr int DX[] = {1, 0, -1, 0, 0, 0};
constexpr int DY[] = {0, 1, 0, -1, 0, 0};
constexpr int DZ[] = {0, 0, 0,  0, 1, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;
//const ll MOD = 1000000007;

int main() {
    ios::sync_with_stdio(false); 
    std::cin.tie(nullptr);
    int n, q;
    cin >> n;
    VI a(n + 2, 0);
    REP(i, n) cin >> a[i + 1];
    a[n + 1] = INF;
    cin >> q;
    VI w(q), x(q), y(q);
    REP(i, q) {
        cin >> w[i] >> x[i];
        if (w[i] == 1) cin >> y[i];
    }
    map<int, int> f, b;
    b[0] = a[1];
    f[INF] = a[n];
    REP(i, n) {
        f[a[i + 1]] = a[i];
        b[a[i + 1]] = a[i + 2];
    }
    REP(i, q) {
        //cout << "i=" << i << endl;
        if (w[i] == 1) {
            int z = b[x[i]];
            b[x[i]] = y[i];
            f[y[i]] = x[i];
            b[y[i]] = z;
            f[z] = y[i];
        } else {
            int fx = f[x[i]];
            int bx = b[x[i]];
            b[fx] = bx;
            f[bx] = fx;
        }
    }
    VI ans(0);
    int z = b[0];
    while (z != INF) {
        //cout << "z=" << z << endl;
        ans.push_back(z);
        z = b[z];
    }
    REP(i, ans.size()) {
        if (i) cout << " ";
        cout << ans[i];
    }
    cout << endl;
}

Submission Info

Judge Result