結果
問題 | No.1558 Derby Live |
ユーザー |
![]() |
提出日時 | 2021-06-25 22:23:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 222 ms / 2,000 ms |
コード長 | 7,769 bytes |
コンパイル時間 | 3,847 ms |
コンパイル使用メモリ | 205,620 KB |
最終ジャッジ日時 | 2025-01-22 12:22:18 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
ソースコード
#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(), (x).end()template <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';return os;}template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}void debug_out() { cerr << '\n'; }template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) \cerr << " "; \cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \cerr << " "; \debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}#pragma endregion/*** @brief Segment Tree* @docs docs/datastructure/SegmentTree.md*/template <typename Monoid> struct SegmentTree {typedef function<Monoid(Monoid, Monoid)> F;int n;F f;Monoid id;vector<Monoid> dat;SegmentTree(int n_, F f, Monoid id) : f(f), id(id) { init(n_); }void init(int n_) {n = 1;while (n < n_) n <<= 1;dat.assign(n << 1, id);}void build(const vector<Monoid>& v) {for (int i = 0; i < (int)v.size(); i++) dat[i + n] = v[i];for (int i = n - 1; i; i--) dat[i] = f(dat[i << 1 | 0], dat[i << 1 | 1]);}void update(int k, Monoid x) {dat[k += n] = x;while (k >>= 1) dat[k] = f(dat[k << 1 | 0], dat[k << 1 | 1]);}Monoid query(int a, int b) {if (a >= b) return id;Monoid vl = id, vr = id;for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {if (l & 1) vl = f(vl, dat[l++]);if (r & 1) vr = f(dat[--r], vr);}return f(vl, vr);}template <typename C> int find_subtree(int k, const C& check, Monoid& M, bool type) {while (k < n) {Monoid nxt = type ? f(dat[k << 1 | type], M) : f(M, dat[k << 1 | type]);if (check(nxt))k = k << 1 | type;elseM = nxt, k = k << 1 | (type ^ 1);}return k - n;}// min i s.t. f(seg[a],seg[a+1],...,seg[i]) satisfy "check"template <typename C> int find_first(int a, const C& check) {Monoid L = id;if (a <= 0) {if (check(f(L, dat[1]))) return find_subtree(1, check, L, false);return -1;}int b = n;for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {if (l & 1) {Monoid nxt = f(L, dat[l]);if (check(nxt)) return find_subtree(l, check, L, false);L = nxt;l++;}}return -1;}// max i s.t. f(seg[i],...,seg[b-2],seg[b-1]) satisfy "check"template <typename C> int find_last(int b, const C& check) {Monoid R = id;if (b >= n) {if (check(f(dat[1], R))) return find_subtree(1, check, R, true);return -1;}int a = n;for (int l = a, r = b + n; l < r; l >>= 1, r >>= 1) {if (r & 1) {Monoid nxt = f(dat[--r], R);if (check(nxt)) return find_subtree(r, check, R, true);R = nxt;}}return -1;}Monoid operator[](int i) { return dat[i + n]; }};const int INF = 1e9;const long long IINF = 1e18;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const char dir[4] = {'D', 'R', 'U', 'L'};const long long MOD = 1000000007;// const long long MOD = 998244353;int main() {cin.tie(0);ios::sync_with_stdio(false);int N, M, Q;cin >> N >> M >> Q;auto f = [&](vector<int> a, vector<int> b) {vector<int> c(N);for (int i = 0; i < N; i++) c[i] = a[b[i]];return c;};vector<int> id(N);iota(ALL(id), 0);SegmentTree<vector<int>> seg(M, f, id);auto update = [&]() {int D;cin >> D;vector<int> P(N);for (int i = 0; i < N; i++) {int x;cin >> x;P[--x] = i;}seg.update(--D, P);};for (; Q--;) {int t;cin >> t;if (t == 1)update();else if (t == 2) {int S;cin >> S;vector<int> res = seg.query(0, S);for (int i = 0; i < N; i++) cout << res[i] + 1 << (i + 1 == N ? '\n' : ' ');} else {int L, R;cin >> L >> R;vector<int> res = seg.query(--L, R);int ans = 0;for (int i = 0; i < N; i++) ans += abs(i - res[i]);cout << ans << '\n';}}return 0;}