結果
問題 | No.2992 Range ABCD String Query |
ユーザー |
👑 |
提出日時 | 2024-12-17 00:06:15 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 443 ms / 6,000 ms |
コード長 | 14,943 bytes |
コンパイル時間 | 3,687 ms |
コンパイル使用メモリ | 263,668 KB |
実行使用メモリ | 48,884 KB |
最終ジャッジ日時 | 2024-12-17 00:07:25 |
合計ジャッジ時間 | 16,725 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 41 |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")// #define INTERACTIVE#include <bits/stdc++.h>using namespace std;namespace templates {// typeusing ll = long long;using ull = unsigned long long;using Pii = pair<int, int>;using Pil = pair<int, ll>;using Pli = pair<ll, int>;using Pll = pair<ll, ll>;template <class T>using pq = priority_queue<T>;template <class T>using qp = priority_queue<T, vector<T>, greater<T>>;// clang-format off#define vec(T, A, ...) vector<T> A(__VA_ARGS__);#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));// clang-format on// for loop#define fori1(a) for (ll _ = 0; _ < (a); _++)#define fori2(i, a) for (ll i = 0; i < (a); i++)#define fori3(i, a, b) for (ll i = (a); i < (b); i++)#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))#define overload4(a, b, c, d, e, ...) e#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)// declare and input// clang-format off#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);#define VEC(T, A, n) vector<T> A(n); inp(A);#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);// clang-format on// const valueconst ll MOD1 = 1000000007;const ll MOD9 = 998244353;const double PI = acos(-1);// other macro#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)#define endl "\n"#endif#define spa ' '#define len(A) ll(A.size())#define all(A) begin(A), end(A)// functionvector<char> stoc(string &S) {int n = S.size();vector<char> ret(n);for (int i = 0; i < n; i++) ret[i] = S[i];return ret;}string ctos(vector<char> &S) {int n = S.size();string ret = "";for (int i = 0; i < n; i++) ret += S[i];return ret;}template <class T>auto min(const T &a) {return *min_element(all(a));}template <class T>auto max(const T &a) {return *max_element(all(a));}template <class T, class S>auto clamp(T &a, const S &l, const S &r) {return (a > r ? r : a < l ? l : a);}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}template <class T, class S>inline bool chclamp(T &a, const S &l, const S &r) {auto b = clamp(a, l, r);return (a != b ? a = b, 1 : 0);}template <typename T>T sum(vector<T> &A) {T tot = 0;for (auto a : A) tot += a;return tot;}template <typename T>vector<T> compression(vector<T> X) {sort(all(X));X.erase(unique(all(X)), X.end());return X;}// input and outputnamespace io {// __int128_tstd::istream &operator>>(std::istream &is, __int128_t &value) {std::string str;is >> str;value = 0;int sign = 1;for (size_t i = 0; i < str.size(); i++) {if (i == 0 && str[i] == '-') {sign = -1;continue;}value = value * 10 + str[i] - '0';}value *= sign;return is;}std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}// vector<T>template <typename T>istream &operator>>(istream &is, vector<T> &A) {for (auto &a : A) is >> a;return is;}template <typename T>ostream &operator<<(ostream &os, vector<T> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << ' ';}return os;}// vector<vector<T>>template <typename T>istream &operator>>(istream &is, vector<vector<T>> &A) {for (auto &a : A) is >> a;return is;}template <typename T>ostream &operator<<(ostream &os, vector<vector<T>> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << endl;}return os;}// pair<S, T>template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &A) {is >> A.first >> A.second;return is;}template <typename S, typename T>ostream &operator<<(ostream &os, pair<S, T> &A) {os << A.first << ' ' << A.second;return os;}// vector<pair<S, T>>template <typename S, typename T>istream &operator>>(istream &is, vector<pair<S, T>> &A) {for (size_t i = 0; i < A.size(); i++) {is >> A[i];}return is;}template <typename S, typename T>ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << endl;}return os;}// tupletemplate <typename T, size_t N>struct TuplePrint {static ostream &print(ostream &os, const T &t) {TuplePrint<T, N - 1>::print(os, t);os << ' ' << get<N - 1>(t);return os;}};template <typename T>struct TuplePrint<T, 1> {static ostream &print(ostream &os, const T &t) {os << get<0>(t);return os;}};template <typename... Args>ostream &operator<<(ostream &os, const tuple<Args...> &t) {TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);return os;}// io functionsvoid FLUSH() {cout << flush;}void print() {cout << endl;}template <class Head, class... Tail>void print(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail)) cout << spa;print(std::forward<Tail>(tail)...);}template <typename T, typename S>void prisep(vector<T> &A, S sep) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << sep;}cout << endl;}template <typename T, typename S>void priend(T A, S end) {cout << A << end;}template <typename T>void prispa(T A) {priend(A, spa);}template <typename T, typename S>bool printif(bool f, T A, S B) {if (f)print(A);elseprint(B);return f;}template <class... T>void inp(T &...a) {(cin >> ... >> a);}} // namespace iousing namespace io;// read graphvector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<int>> edges(n, vector<int>());for (int i = 0; i < m; i++) {INT(u, v);u -= indexed;v -= indexed;edges[u].push_back(v);if (!direct) edges[v].push_back(u);}return edges;}vector<vector<int>> read_tree(int n, int indexed = 1) {return read_edges(n, n - 1, false, indexed);}template <typename T = long long>vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());for (int i = 0; i < m; i++) {INT(u, v);T w;inp(w);u -= indexed;v -= indexed;edges[u].push_back({v, w});if (!direct) edges[v].push_back({u, w});}return edges;}template <typename T = long long>vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {return read_wedges<T>(n, n - 1, false, indexed);}// yes / nonamespace yesno {// yesinline bool yes(bool f = true) {cout << (f ? "yes" : "no") << endl;return f;}inline bool Yes(bool f = true) {cout << (f ? "Yes" : "No") << endl;return f;}inline bool YES(bool f = true) {cout << (f ? "YES" : "NO") << endl;return f;}// noinline bool no(bool f = true) {cout << (!f ? "yes" : "no") << endl;return f;}inline bool No(bool f = true) {cout << (!f ? "Yes" : "No") << endl;return f;}inline bool NO(bool f = true) {cout << (!f ? "YES" : "NO") << endl;return f;}// possibleinline bool possible(bool f = true) {cout << (f ? "possible" : "impossible") << endl;return f;}inline bool Possible(bool f = true) {cout << (f ? "Possible" : "Impossible") << endl;return f;}inline bool POSSIBLE(bool f = true) {cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;return f;}// impossibleinline bool impossible(bool f = true) {cout << (!f ? "possible" : "impossible") << endl;return f;}inline bool Impossible(bool f = true) {cout << (!f ? "Possible" : "Impossible") << endl;return f;}inline bool IMPOSSIBLE(bool f = true) {cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;return f;}// Alice Bobinline bool Alice(bool f = true) {cout << (f ? "Alice" : "Bob") << endl;return f;}inline bool Bob(bool f = true) {cout << (f ? "Bob" : "Alice") << endl;return f;}// Takahashi Aokiinline bool Takahashi(bool f = true) {cout << (f ? "Takahashi" : "Aoki") << endl;return f;}inline bool Aoki(bool f = true) {cout << (f ? "Aoki" : "Takahashi") << endl;return f;}} // namespace yesnousing namespace yesno;} // namespace templatesusing namespace templates;template <class S, S (*op)(S, S), S (*e)()>struct segtree {public:segtree() : segtree(0) {}explicit segtree(int n) : segtree(std::vector<S>(n, e())) {};explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {size = 1;log = 0;while (size < _n) {log++;size <<= 1;}d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) update(i);}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() {return d[1];}private:int _n, size, log;std::vector<S> d;void update(int k) {d[k] = op(d[2 * k], d[2 * k + 1]);}};struct S {array<array<int, 4>, 4> arr;};S op(S l, S r) {S ret;for (int i = 0; i < 4; i++) {for (int j = i; j < 4; j++) {ret.arr[i][j] = 0;for (int k = i; k <= j; k++) {chmax(ret.arr[i][j], l.arr[i][k] + r.arr[k][j]);}}}return ret;}S e() {S ret;for (int i = 0; i < 4; i++) {for (int j = 0; j < 4; j++) {ret.arr[i][j] = 0;}}return ret;}void solve() {INT(n, Q);STRING(T);S a = e();S b = e();S c = e();S d = e();for (int i = 0; i < 4; i++)for (int j = i; j < 4; j++) {if (i <= 0 and 0 <= j) a.arr[i][j] = 1;if (i <= 1 and 1 <= j) b.arr[i][j] = 1;if (i <= 2 and 2 <= j) c.arr[i][j] = 1;if (i <= 3 and 3 <= j) d.arr[i][j] = 1;}vec(S, ini, n);fori(i, n) {if (T[i] == 'A') ini[i] = a;if (T[i] == 'B') ini[i] = b;if (T[i] == 'C') ini[i] = c;if (T[i] == 'D') ini[i] = d;}segtree<S, op, e> seg(ini);fori(Q) {INT(t);if (t == 1) {INT(x);x--;CHAR(s);if (s == 'A') seg.set(x, a);if (s == 'B') seg.set(x, b);if (s == 'C') seg.set(x, c);if (s == 'D') seg.set(x, d);} else {INT(l, r);auto ans = seg.prod(l - 1, r);print(r - l + 1 - ans.arr[0][3]);}}}int main() {#ifndef INTERACTIVEstd::cin.tie(0)->sync_with_stdio(0);#endif// std::cout << std::fixed << std::setprecision(12);int t;t = 1;// std::cin >> t;while (t--) solve();return 0;}// // #pragma GCC target("avx2")// // #pragma GCC optimize("O3")// // #pragma GCC optimize("unroll-loops")// // #define INTERACTIVE//// #include "kyopro-cpp/template.hpp"//// #include "data_structure/segTree.hpp"//// struct S {// array<array<int, 4>, 4> arr;// };// S op(S l, S r) {// S ret;// for (int i = 0; i < 4; i++) {// for (int j = i; j < 4; j++) {// ret.arr[i][j] = 0;// for (int k = i; k <= j; k++) {// chmax(ret.arr[i][j], l.arr[i][k] + r.arr[k][j]);// }// }// }// return ret;// }// S e() {// S ret;// for (int i = 0; i < 4; i++) {// for (int j = 0; j < 4; j++) {// ret.arr[i][j] = 0;// }// }// return ret;// }//// void solve() {// INT(n, Q);// STRING(T);// S a = e();// S b = e();// S c = e();// S d = e();// for (int i = 0; i < 4; i++)// for (int j = i; j < 4; j++) {// if (i <= 0 and 0 <= j) a.arr[i][j] = 1;// if (i <= 1 and 1 <= j) b.arr[i][j] = 1;// if (i <= 2 and 2 <= j) c.arr[i][j] = 1;// if (i <= 3 and 3 <= j) d.arr[i][j] = 1;// }//// vec(S, ini, n);// fori(i, n) {// if (T[i] == 'A') ini[i] = a;// if (T[i] == 'B') ini[i] = b;// if (T[i] == 'C') ini[i] = c;// if (T[i] == 'D') ini[i] = d;// }// segtree<S, op, e> seg(ini);// fori(Q) {// INT(t);// if (t == 1) {// INT(x);// x--;// CHAR(s);// if (s == 'A') seg.set(x, a);// if (s == 'B') seg.set(x, b);// if (s == 'C') seg.set(x, c);// if (s == 'D') seg.set(x, d);// } else {// INT(l, r);// auto ans = seg.prod(l - 1, r);// print(r - l + 1 - ans.arr[0][3]);// }// }// }//// int main() {// #ifndef INTERACTIVE// std::cin.tie(0)->sync_with_stdio(0);// #endif// // std::cout << std::fixed << std::setprecision(12);// int t;// t = 1;// // std::cin >> t;// while (t--) solve();// return 0;// }