#1195833 (C++23) No.2338 Range AtCoder Query

• 問題: No.2338 Range AtCoder Query
• ユーザー: noya2
• 提出日時: 2026-10-29 16:55:34
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 628 ms / 4,000 ms
• コード長: 7,449 bytes
• コンパイル時間: 2,934 ms
• コンパイル使用メモリ: 357,216 KB
• 実行使用メモリ: 13,440 KB
• 最終ジャッジ日時: 2026-10-29 16:56:15
• 合計ジャッジ時間: 26,325 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge7_0

ファイルパターン	結果
sample	AC * 1
other	AC * 35

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n, m, q; in(n,m,q);
    vector<pii> a(n);
    rep(i,n){
        int p; in(p); p--;
        string s; in(s);
        a[i] = {p, int(s[0] == 'A')};
    }
    const int sq = 300;
    // const int sq = 2;
    vector<vector<int>> qs(n/sq+2);
    vector<pii> ans(q);
    vector<int> accnt(m), wacnt(m);
    auto naive = [&](int l, int r){
        int actot = 0, watot = 0;
        repp(i,l,r){
            auto [j, ac] = a[i];
            if (ac == 1){
                if (accnt[j] == 0){
                    actot++;
                    watot += wacnt[j];
                }
                accnt[j]++;
            }
            else {
                if (accnt[j] == 0){
                    wacnt[j]++;
                }
            }
        }
        repp(i,l,r){
            auto [j, ac] = a[i];
            accnt[j] = 0;
            wacnt[j] = 0;
        }
        return pii(actot,watot);
    };
    vector<pii> lrs(q);
    rep(i,q){
        int l, r; in(l,r); l--;
        if (r-l <= sq){
            ans[i] = naive(l,r);
        }
        else {
            lrs[i] = {l,r};
            int il = ceil_div(l,sq);
            qs[il].emplace_back(i);
            assert(il*sq <= r);
        }
    }
    vector<tuple<int,int,int>> memoacwa(n);
    rep(b,n/sq+2){
        if (qs[b].empty()) continue;
        ranges::sort(qs[b], {}, [&](int i){
            return lrs[i].second;
        });
        fill(all(accnt),0);
        fill(all(wacnt),0);
        int actot = 0;
        int watot = 0;
        int r = b*sq;
        for (int i : qs[b]){
            while (r < lrs[i].second){
                auto [j, ac] = a[r];
                if (ac == 1){
                    if (accnt[j] == 0){
                        watot += wacnt[j];
                        actot++;
                    }
                    accnt[j]++;
                }
                else {
                    if (accnt[j] == 0){
                        wacnt[j]++;
                    }
                }
                r++;
            }
            int memoactot = actot;
            int memowatot = watot;
            for (int l = b*sq-1; l >= lrs[i].first; l--){
                auto [j, ac] = a[l];
                memoacwa[l] = {j, accnt[j], wacnt[j]};
                if (ac == 1){
                    if (accnt[j] > 0){
                        watot -= wacnt[j];
                    }
                    else {
                        actot++;
                    }
                    accnt[j]++;
                    wacnt[j] = 0;
                }
                else {
                    if (accnt[j] > 0){
                        watot++;
                    }
                    wacnt[j]++;
                }
            }
            ans[i] = {actot, watot};
            repp(l,lrs[i].first,b*sq){
                auto [j, accntj, wacntj] = memoacwa[l];
                accnt[j] = accntj;
                wacnt[j] = wacntj;
            }
            actot = memoactot;
            watot = memowatot;
        }
    }
    rep(i,q){
        out(ans[i]);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}