結果
問題 | No.2338 Range AtCoder Query |
ユーザー |
![]() |
提出日時 | 2023-06-02 23:03:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 643 ms / 4,000 ms |
コード長 | 7,115 bytes |
コンパイル時間 | 2,550 ms |
コンパイル使用メモリ | 207,828 KB |
最終ジャッジ日時 | 2025-02-13 20:03:52 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 34 |
ソースコード
#line 1 "main.cpp"//#pragma GCC target("avx")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>#ifdef LOCAL#include <debug.hpp>#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else#define debug(...) (static_cast<void>(0))#endifusing namespace std;using ll = long long;using ld = long double;using pll = pair<ll, ll>;using pii = pair<int, int>;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vpii = vector<pii>;using vpll = vector<pll>;using vs = vector<string>;template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;#define overload4(_1, _2, _3, _4, name, ...) name#define overload3(a,b,c,name,...) name#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)#define rep2(i, n) for (ll i = 0; i < (n); ++i)#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)#define all1(i) begin(i) , end(i)#define all2(i,a) begin(i) , begin(i) + a#define all3(i,a,b) begin(i) + a , begin(i) + b#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)#define sum(...) accumulate(all(__VA_ARGS__),0LL)template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }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... Ts> void in(Ts&... t);#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)#define VEC(type, name, size) vector<type> name(size); in(name)#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}namespace IO{#define VOID(a) decltype(void(a))struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;template<int I> struct P : P<I-1>{};template<> struct P<0>{};template<class T> void i(T& t){ i(t, P<3>{}); }void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}#undef VOID}#define unpack(a) (void)initializer_list<int>{(a, 0)...}template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }#undef unpackstatic const double PI = 3.1415926535897932;template <class F> struct REC {F f;REC(F &&f_) : f(forward<F>(f_)) {}template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};//constexpr int mod = 1000000007;constexpr int mod = 998244353;#line 2 "library/misc/Mo.hpp"struct Mo {int width;vector<int> left,right,order;Mo(int N,int Q):order(Q) {width = max<int>(1, 1.0 * N / max<double>(1.0, sqrt(Q * 2.0 / 3.0)));iota(begin(order),end(order),0);}void insert(int l,int r) { /* [l, r) */left.emplace_back(l);right.emplace_back(r);}template<typename AL,typename AR,typename DL,typename DR,typename REM>void run(const AL &add_left,const AR &add_right,const DL &delete_left,const DR &delete_right,const REM &rem) {assert(left.size() == order.size());sort(begin(order),end(order),[&](int a,int b){int abl = left[a] / width,bbl = left[b] / width;if(abl != bbl) return abl < bbl;if(abl & 1) return right[a] < right[b];return right[a] > right[b];});int nl = 0,nr = 0;for(int idx:order) {while(nl > left[idx]) add_left(--nl);while(nr < right[idx]) add_right(nr++);while(nl < left[idx]) delete_left(nl++);while(nr > right[idx]) delete_right(--nr);rem(idx);}}};#line 86 "main.cpp"int main() {INT(n,m,q);vi p(n),ac(n);rep(i,n) {cin >> p[i];p[i]--;STR(s);ac[i] = (s == "AC");}vvi pos(m);rep(i,n) pos[p[i]].emplace_back(i);vi MIDL(n),MIDR(n);rep(i,m) {int l = -1,c = 0;for(auto &id:pos[i]) {if(ac[id]) {if(l != -1) {MIDR[l] = c;}l = id;MIDL[id] = c;c = 0;}else c++;}}vi cac(m);vi wac(m);int su = 0,wa = 0;Mo mo(n,q);rep(i,q) {INT(l,r);l--;mo.insert(l,r);}auto ADDL = [&](int x) {if(ac[x]) {if(cac[p[x]] == 0) su++;else wa -= MIDR[x];cac[p[x]]++;}else {if(cac[p[x]] > 0) wa++;wac[p[x]]++;}};auto ADDR = [&](int x) {if(ac[x]) {if(cac[p[x]] == 0) {su++;wa += wac[p[x]];}cac[p[x]]++;}else wac[p[x]]++;};auto DELL = [&](int x) {if(ac[x]) {cac[p[x]]--;if(cac[p[x]] == 0) su--;else wa += MIDR[x];}else {if(cac[p[x]] > 0) wa--;wac[p[x]]--;}};auto DELR = [&](int x) {if(ac[x]) {cac[p[x]]--;if(cac[p[x]] == 0) {su--;wa -= wac[p[x]];}}else {wac[p[x]]--;}};vi ansa(q),answ(q);auto rem = [&](int x) {ansa[x] = su;answ[x] = wa;};mo.run(ADDL,ADDR,DELL,DELR,rem);rep(i,q) cout << ansa[i] << " " << answ[i] << '\n';}