結果

問題 No.2002 Range Swap Query
コンテスト
ユーザー satashun
提出日時 2022-07-08 22:30:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 311 ms / 2,000 ms
コード長 5,217 bytes
コンパイル時間 2,811 ms
コンパイル使用メモリ 210,592 KB
最終ジャッジ日時 2025-01-30 05:26:27
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
void scan(vector<T>& v, T offset = T(0)) {
    for (auto& x : v) {
        cin >> x;
        x += offset;
    }
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

void slv() {
    int N, K, Q;
    cin >> N >> K >> Q;
    V<priority_queue<pii>> ques(N);
    V<pii> ope(K);
    cin >> ope;
    for (auto& [a, b] : ope) {
        --a, --b;
    }
    V<int> L(Q), R(Q), X(Q);
    VV<int> ins(K);
    V<int> ans(Q);

    rep(i, Q) {
        cin >> L[i] >> R[i] >> X[i];
        --L[i];
        --R[i];
        --X[i];
        ins[R[i]].pb(i);
    }

    per(i, K) {
        auto [a, b] = ope[i];

        while (SZ(ques[a])) {
            auto tp = ques[a].top();
            if (tp.fi > i) {
                ans[tp.se] = a;
                ques[a].pop();
            } else
                break;
        }

        while (SZ(ques[b])) {
            auto tp = ques[b].top();
            if (tp.fi > i) {
                ans[tp.se] = b;
                ques[b].pop();
            } else
                break;
        }

        debug(i);
        for (int p : ins[i]) {
            ques[X[p]].emplace(L[p], p);
        }

        swap(ques[a], ques[b]);
        while (SZ(ques[a])) {
            auto tp = ques[a].top();
            if (tp.fi == i) {
                ans[tp.se] = a;
                ques[a].pop();
            } else
                break;
        }

        while (SZ(ques[b])) {
            auto tp = ques[b].top();
            if (tp.fi == i) {
                ans[tp.se] = b;
                ques[b].pop();
            } else
                break;
        }
    }

    rep(a, N) {
        while (SZ(ques[a])) {
            auto tp = ques[a].top();
            ans[tp.se] = a;
            ques[a].pop();
        }
    }

    rep(i, Q) show(ans[i] + 1);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}
0