#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define dame { cout << "No" << endl; return;} #define dame1 { cout << -1 << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<>n>>m>>q; vi p(n); vs s(n); rep(i,n){ cin>>p[i],p[i]--; cin>>s[i]; } vpii ans(q); ll D = ceill((long double)n/sqrtl((long double)q)); int maxc = n/D; vector> pock(maxc+1); rep(i,q){ int l,r; cin>>l>>r; l--; r--; pock[l/D].pb(state(l,r,i)); } // ll now=0; ll kind_ac = 0; ll sum_wa = 0; vl cnt_ac(m); vector> cnt_wa(m); rep(i,m) cnt_wa[i].pb(0); auto add = [&](int l,int r,int type) -> pii{ int x; if (type == 0){ x = --l; }else{ x = ++r; } if (s[x]=="AC"){ cnt_ac[p[x]]++; if (cnt_ac[p[x]]==1){ kind_ac++; } if (type==0){ if (cnt_ac[p[x]]>1) sum_wa -= cnt_wa[p[x]].front(); cnt_wa[p[x]].push_front(0); }else{ if (cnt_ac[p[x]]==1){ sum_wa += cnt_wa[p[x]].front(); } cnt_wa[p[x]].push_back(0); } }else{ if (type==0){ if (cnt_ac[p[x]]) sum_wa++; cnt_wa[p[x]].front()++; }else{ cnt_wa[p[x]].back()++; } } return {l,r}; }; auto del = [&](int l,int r,int type) -> pii{ int x; if (type == 0){ x = l++; }else{ x = r--; } if (s[x]=="AC"){ cnt_ac[p[x]]--; if (cnt_ac[p[x]]==0){ kind_ac--; } if (type==0){ assert(cnt_wa[p[x]][0]==0); cnt_wa[p[x]].pop_front(); if (cnt_ac[p[x]]>0) sum_wa += cnt_wa[p[x]].front(); }else{ assert(cnt_wa[p[x]].back()==0); cnt_wa[p[x]].pop_back(); if (cnt_ac[p[x]]==0) sum_wa -= cnt_wa[p[x]].front(); } }else{ if (type==0){ cnt_wa[p[x]].front()--; if (cnt_ac[p[x]]>0) sum_wa--; }else{ cnt_wa[p[x]].back()--; } } return {l,r}; }; auto to = [&](int stl,int str,int gol,int gor){ int x = gol - stl; int y = gor - str; while(x != 0 || y != 0){ if (y > 0){ pii p = add(stl,str,1); stl = p.fi; str = p.se; y--; }else if (y < 0){ pii p = del(stl,str,1); stl = p.fi; str = p.se; y++; } if (x > 0){ pii p = del(stl,str,0); stl = p.fi; str = p.se; x--; }else if(x < 0){ pii p = add(stl,str,0); stl = p.fi; str = p.se; x++; } } }; int l=0,r=0; add(0,-1,1); rep(i,maxc+1){ if (i%2 == 0){ sort(rng(pock[i])); }else{ sort(rrng(pock[i])); } fore(y , pock[i]){ to(l,r,y.l,y.r); ans[y.i].fi = kind_ac; ans[y.i].se = sum_wa; l = y.l; r = y.r; } } rep(i,q) coutp(ans[i]); return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }