#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } const std::vector> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); } template std::pair operator+(const std::pair &l, const std::pair &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template std::pair operator-(const std::pair &l, const std::pair &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template std::vector sort_unique(std::vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template IStream &operator>>(IStream &is, std::vector &vec) { for (auto &v : vec) is >> v; return is; } template OStream &operator<<(OStream &os, const std::vector &vec); template OStream &operator<<(OStream &os, const std::array &arr); template OStream &operator<<(OStream &os, const std::unordered_set &vec); template OStream &operator<<(OStream &os, const pair &pa); template OStream &operator<<(OStream &os, const std::deque &vec); template OStream &operator<<(OStream &os, const std::set &vec); template OStream &operator<<(OStream &os, const std::multiset &vec); template OStream &operator<<(OStream &os, const std::unordered_multiset &vec); template OStream &operator<<(OStream &os, const std::pair &pa); template OStream &operator<<(OStream &os, const std::map &mp); template OStream &operator<<(OStream &os, const std::unordered_map &mp); template OStream &operator<<(OStream &os, const std::tuple &tpl); template OStream &operator<<(OStream &os, const std::vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template std::istream &operator>>(std::istream &is, std::tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template OStream &operator<<(OStream &os, const std::tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } template OStream &operator<<(OStream &os, const std::unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::pair &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template OStream &operator<<(OStream &os, const std::map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif #include #include #include #include // Mo's algorithm // - add_range(l, r) : Add [l, r) as query. // - run(Add, Remove, Query) : run Mo's algorithm. // - Add(i) : Add i-th element ([i + 1, r) -> [i, r)). // - Remove(i) : Remove i-th element (Inverse of Add(i)). // - Query(q) : Solve q-th problem. // Veirfied: https://codeforces.com/contest/375/submission/114665433 class MosAlgorithm { static const int INF = 1 << 30; int nmin, nmax; public: std::vector> ranges; MosAlgorithm() : nmin(INF), nmax(-INF) {} void add_range(int l, int r) { assert(l <= r); nmin = std::min(nmin, l); nmax = std::max(nmax, r); ranges.emplace_back(l, r); } template void run(F1 AddRight, F2 AddLeft, F3 RemoveRight, F4 RemoveLeft, F5 Query) { const int Q = ranges.size(); if (!Q) return; const int nbbucket = std::max(1, std::min(nmax - nmin, sqrt(Q))); const int szbucket = (nmax - nmin + nbbucket - 1) / nbbucket; std::vector qs(Q); std::iota(qs.begin(), qs.end(), 0); std::sort(qs.begin(), qs.end(), [&](int q1, int q2) { int b1 = (ranges[q1].first - nmin) / szbucket, b2 = (ranges[q2].first - nmin) / szbucket; if (b1 != b2) return b1 < b2; else { return (b1 & 1) ? (ranges[q1].second > ranges[q2].second) : (ranges[q1].second < ranges[q2].second); } }); int l = ranges[qs[0]].first, r = l; for (auto q : qs) { while (r < ranges[q].second) AddRight(r++); while (l > ranges[q].first) AddLeft(--l); while (r > ranges[q].second) RemoveRight(--r); while (l < ranges[q].first) RemoveLeft(l++); assert(l == ranges[q].first and r == ranges[q].second); Query(q); } } template void run(F1 Add, F3 Remove, F5 Query) { run(Add, Add, Remove, Remove, Query); } }; int main() { int N, M, Q; cin >> N >> M >> Q; vector P(N), status(N); REP(i, N) { cin >> P.at(i); --P.at(i); string str; cin >> str; status.at(i) = (str == "AC"); } dbg(status); vector ret(Q); int ret_ac = 0, ret_penalty = 0; vector account(M); vector penacount(M); vector> deq(M); REP(m, M) deq.at(m).emplace_back(0, 0); auto solve = [&](int q) { dbg(make_tuple(q, deq)); ret.at(q) = make_pair(ret_ac, ret_penalty); }; auto calc = [&](int m) { account.at(m) = deq.at(m).front().second > 0; penacount.at(m) = deq.at(m).front().first * deq.at(m).front().second; ret_ac += account.at(m) > 0; ret_penalty += penacount.at(m) * account.at(m); }; auto add_left = [&](int i) { int m = P.at(i), s = status.at(i); ret_ac -= account.at(m) > 0; ret_penalty -= penacount.at(m); if (s) { deq.at(m).emplace_front(0, 1); } else { deq.at(m).front().first++; } calc(m); }; auto add_right = [&](int i) { int m = P.at(i), s = status.at(i); ret_ac -= account.at(m) > 0; ret_penalty -= penacount.at(m); if (s) { if (deq.at(m).back().second) { deq.at(m).emplace_back(0, 1); } else { deq.at(m).back().second = 1; } } else { if (deq.at(m).back().second) { deq.at(m).emplace_back(1, 0); } else { deq.at(m).back().first++; } } calc(m); }; auto remove_left = [&](int i) { int m = P.at(i), s = status.at(i); ret_ac -= account.at(m) > 0; ret_penalty -= penacount.at(m); if (s) { assert(deq.at(m).front().first == 0 and deq.at(m).front().second == 1); deq.at(m).pop_front(); } else { assert(deq.at(m).front().first > 0); deq.at(m).front().first--; } calc(m); }; auto remove_right = [&](int i) { int m = P.at(i), s = status.at(i); ret_ac -= account.at(m) > 0; ret_penalty -= penacount.at(m); if (s) { assert(deq.at(m).back().second == 1); deq.at(m).back().second = 0; if (!deq.at(m).back().first and deq.at(m).size() > 1) deq.at(m).pop_back(); } else { deq.at(m).back().first--; } calc(m); }; MosAlgorithm mo; while (Q--) { int l, r; cin >> l >> r; --l; mo.add_range(l, r); } mo.run(add_right, add_left, remove_right, remove_left, solve); for (auto [x, y] : ret) cout << x << ' ' << y << '\n'; }