結果
問題 | No.1558 Derby Live |
ユーザー |
![]() |
提出日時 | 2021-06-25 22:07:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 5,068 bytes |
コンパイル時間 | 4,544 ms |
コンパイル使用メモリ | 211,596 KB |
最終ジャッジ日時 | 2025-01-22 12:16:43 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
ソースコード
#define MOD_TYPE 1#pragma region Macros#include <bits/stdc++.h>using namespace std;#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#if 0#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/tag_and_trait.hpp>#include <ext/rope>using namespace __gnu_pbds;using namespace __gnu_cxx;template <typename T>using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#endif#if 0#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endifusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename T>using smaller_queue = priority_queue<T, vector<T>, greater<T>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr ld PI = acos(-1.0);constexpr ld EPS = 1e-7;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";struct io_init{io_init(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val){fill((T *)array, (T *)(array + N), val);}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept{is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept{os << p.first << " " << p.second;return os;}#pragma endregion// --------------------------------------template <typename T>struct SegmentTree{using F = function<T(T, T)>;int N;vector<T> dat;T ti;F f;SegmentTree() {}SegmentTree(int n, F f, T ti) : f(f), ti(ti){N = 1;while (N < n)N *= 2;dat.assign(2 * N - 1, ti);}SegmentTree(const vector<T> &v, F f, T ti) : f(f), ti(ti){N = 1;int sz = v.size();while (N < sz)N *= 2;dat.resize(2 * N - 1);for (int i = 0; i < N; ++i)dat[i + N - 1] = (i < sz ? v[i] : ti);for (int i = N - 2; i >= 0; --i)dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);}void update(int k, T a){k += N - 1;dat[k] = a;while (k > 0){k = (k - 1) / 2;dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);}}T get(int k) { return dat[k + N - 1]; }T query(int a, int b, int k, int l, int r){if (r <= a or b <= l)return ti;if (a <= l and r <= b)return dat[k];T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);return f(vl, vr);}T query(int a, int b) { return query(a, b, 0, 0, N); }T query_all() { return dat[0]; }void display(){for (int i = 0; i < N; i++)cerr << get(i) << " ";cerr << "\n";}};int n, m, q;int E(vector<int> &L, vector<int> &R){int sum = 0;rep(i, n){sum += abs(R[i] - L[i]);}return sum;}void solve(){cin >> n >> m >> q;auto f = [&](vector<int> p, vector<int> q){vector<int> res(n);iota(all(res), 0);rep(i, n) res[i] = q[p[i]];return res;};vector<int> e(n);iota(all(e), 0);SegmentTree<vector<int>> sg(m, f, e);rep(qi, q){int type;cin >> type;if (type == 1){int d;cin >> d;d--;vector<int> p(n);rep(i, n) cin >> p[i], p[i]--;sg.update(d, p);}else if (type == 2){int s;cin >> s;vector<int> p = sg.query(0, s);vector<int> ans(n);rep(i, n) ans[p[i]] = i + 1;rep(i, n) cout << ans[i] << (i == n - 1 ? "\n" : " ");}else{int l, r;cin >> l >> r;vector<int> L = sg.query(0, l - 1);vector<int> R = sg.query(0, r);cout << E(L, R) << "\n";}}}int main(){solve();}