#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") // #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #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) printf("%d %d\n",p.fi,p.se); #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"< start; // std::int64_t limit_microsec = 0; // public: // CTimer(); // void set(std::int64_t time_microsec); // bool elapsed() const; // ld GetClocksMagni() const; // std::int64_t getMicrosec() const; // }; // #else // class CTimer { // static const std::uint64_t ClocksPerMicrosec; // const std::uint64_t start_clocks; // std::uint64_t limit_clocks; // std::uint64_t getClocks() const; // public: // CTimer(); // void set(std::int64_t time_microsec); // bool elapsed() const; // ld GetClocksMagni() const; // std::int64_t getMicrosec() const; // }; // #endif // #ifdef MY_LOCAL_DEBUG // using namespace std::chrono; // CTimer::CTimer() // : start(system_clock::now()) { // } // void CTimer::set(std::int64_t time_microsec) { // limit_microsec += time_microsec; // } // bool CTimer::elapsed() const { // return getMicrosec() >= limit_microsec; // } // std::int64_t CTimer::getMicrosec() const { // return duration_cast(system_clock::now() - start).count(); // } // ld CTimer::GetClocksMagni() const { // ld ret = (ld)(limit_microsec - getMicrosec()) / limit_microsec; // return ret; // } // #else // const std::uint64_t CTimer::ClocksPerMicrosec = 2987; // std::uint64_t CTimer::getClocks() const { // unsigned int lo, hi; // __asm__ volatile ("rdtsc" : "=a" (lo), "=d" (hi)); // return ((std::uint64_t)hi << 32) | lo; // } // CTimer::CTimer() // : start_clocks(getClocks()), limit_clocks(start_clocks) { // } // void CTimer::set(std::int64_t time_microsec) { // limit_clocks += time_microsec * ClocksPerMicrosec; // } // bool CTimer::elapsed() const { // return getClocks() >= limit_clocks; // } // std::int64_t CTimer::getMicrosec() const { // return (getClocks() - start_clocks) / ClocksPerMicrosec; // } // ld CTimer::GetClocksMagni() const { // ld ret = (ld)(limit_clocks - getClocks()) / (limit_clocks-start_clocks); // return ret; // } // #endif struct state{ int l,r,i; state(int l=0,int r=0,int i=0) : l(l),r(r),i(i) {} bool operator<(state const &ot) const{ return r < ot.r; } }; void solve(){ int n,m,q; cin>>n>>m>>q; vi p(n); vs s(n); vi part(m,1); rep(i,n){ // scanf("%d",&p[i]); cin>>p[i]; p[i]--; cin>>s[i]; if (s[i]=="AC") part[p[i]]++; } // 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; int kind_ac = 0; int sum_wa = 0; vi cnt_ac(m); vvi cnt_wa(m); rep(i,m) cnt_wa[i] = vi(part[i]); vi wl(m),wr(m); auto to = [&](int& stl,int& str,const int& gol,const int& gor){ while (gor > str){ int px = p[++str]; if (s[str]=="AC"){ if (++cnt_ac[px]==1){ kind_ac++; sum_wa += cnt_wa[px][wl[px]]; } wr[px]++; }else{ cnt_wa[px][wr[px]]++; } } while (gol < stl){ int px = p[--stl]; if (s[stl]=="AC"){ if (++cnt_ac[px]==1){ kind_ac++; }else{ sum_wa -= cnt_wa[px][wl[px]]; } wl[px]--; }else{ if (cnt_ac[px]) sum_wa++; cnt_wa[px][wl[px]]++; } } while(gor < str){ int px = p[str]; if (s[str--]=="AC"){ if (--cnt_ac[px]==0){ kind_ac--; sum_wa -= cnt_wa[px][wl[px]]; } wr[px]--; }else{ cnt_wa[px][wr[px]]--; } } while (gol > stl){ int px = p[stl]; if (s[stl++]=="AC"){ if (--cnt_ac[px]==0){ kind_ac--; }else{ sum_wa += cnt_wa[px][wl[px]+1]; } wl[px]++; }else{ cnt_wa[px][wl[px]]--; if (cnt_ac[px]>0) sum_wa--; } } }; int l=0,r=-1; int& px = p[++r]; if (s[r]=="AC"){ if (++cnt_ac[px]==1){ kind_ac++; sum_wa += cnt_wa[px][wl[px]]; } wr[px]++; }else{ cnt_wa[px][wr[px]]++; } 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; } } rep(i,q) coutp(ans[i]); return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); // CTimer timer; int t = 1; //cin>>t; rep(i,t){ solve(); } // show(timer.getMicrosec()); return 0; }