結果

問題 No.2338 Range AtCoder Query
ユーザー noya2noya2
提出日時 2023-06-02 23:07:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,834 ms / 4,000 ms
コード長 6,791 bytes
コンパイル時間 6,346 ms
コンパイル使用メモリ 272,836 KB
実行使用メモリ 36,248 KB
最終ジャッジ日時 2023-08-28 05:39:42
合計ジャッジ時間 71,414 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 4 ms
4,380 KB
testcase_07 AC 3 ms
4,376 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 2,925 ms
22,204 KB
testcase_12 AC 2,669 ms
23,516 KB
testcase_13 AC 3,057 ms
22,536 KB
testcase_14 AC 2,919 ms
21,676 KB
testcase_15 AC 3,504 ms
23,672 KB
testcase_16 AC 3,708 ms
31,616 KB
testcase_17 AC 3,667 ms
31,700 KB
testcase_18 AC 3,660 ms
31,560 KB
testcase_19 AC 3,660 ms
31,556 KB
testcase_20 AC 3,656 ms
31,536 KB
testcase_21 AC 3,662 ms
31,860 KB
testcase_22 AC 3,693 ms
31,556 KB
testcase_23 AC 3,686 ms
31,748 KB
testcase_24 AC 3,834 ms
31,764 KB
testcase_25 AC 3,675 ms
31,580 KB
testcase_26 AC 153 ms
26,292 KB
testcase_27 AC 133 ms
26,324 KB
testcase_28 AC 133 ms
26,296 KB
testcase_29 AC 2,552 ms
31,600 KB
testcase_30 AC 3,335 ms
31,548 KB
testcase_31 AC 1,392 ms
36,244 KB
testcase_32 AC 1,025 ms
36,248 KB
testcase_33 AC 377 ms
31,756 KB
testcase_34 AC 373 ms
31,560 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "c.cpp"
#include<bits/stdc++.h>
#include<atcoder/all>
#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 namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
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";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}

#line 2 "Mo.hpp"

/*

usage : https://nyaannyaan.github.io/library/modulo/multipoint-binomial-sum.hpp

*/

#line 12 "Mo.hpp"

namespace noya2{

struct Mo {
    int width;
    std::vector<int> left, right, order;

    Mo(int N, int Q): order(Q) {
        width = std::max<int>(1, 1.0 * N / std::max<double>(1.0, std::sqrt(Q * 2.0 / 3.0)));
        std::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 ablock = left[a] / width, bblock = left[b] / width;
            if (ablock != bblock) return ablock < bblock;
            if (ablock & 1) return right[a] < right[b];
            return right[a] > right[b];
            });
        int nl = 0, nr = 0;
        for (auto 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 77 "c.cpp"

int op(int a, int b){
    return max(a,b);
}
int e(){
    return 0;
}
bool f(int x){
    return x == 0;
}

void solve(){
    int n, m, q; cin >> n >> m >> q;
    segtree<int,op,e> seg(n);
    vector<vector<int>> a(m), b(m);
    vector<int> c(n), d(n);
    rep(i,n){
        int p; cin >> p; p--;
        string s; cin >> s;
        c[i] = p;
        d[i] = a[p].size();
        a[p].emplace_back(i);
        b[p].emplace_back(s == "AC" ? 1 : 0);
    }
    int id = 0;
    vector<int> pres(m,0);
    rep(i,m){
        int siz = a[i].size();
        rep(j,siz){
            seg.set(id++,b[i][j]);
        }
        if (i != m-1) pres[i+1] = pres[i] + siz;
    }
    int ac = 0, wa = 0;
    vector<int> ls(m,0), rs(m,0);
    auto eval = [&](int i){
        int l = pres[i] + ls[i];
        int r = pres[i] + rs[i];
        if (seg.prod(l,r) == 0) return P(0,0);
        return P(1,seg.max_right<f>(l)-l);
    };
    auto add = [&](int i){
        auto [xac, xwa] = eval(i);
        ac += xac, wa += xwa;
    };
    auto del = [&](int i){
        auto [xac, xwa] = eval(i);
        ac -= xac, wa -= xwa;
    };
    auto adl = [&](int idx){
        int i = c[idx];
        del(i);
        ls[i]--;
        add(i);
    };
    auto adr = [&](int idx){
        int i = c[idx];
        del(i);
        rs[i]++;
        add(i);
    };
    auto dll = [&](int idx){
        int i = c[idx];
        del(i);
        ls[i]++;
        add(i);
    };
    auto dlr = [&](int idx){
        int i = c[idx];
        del(i);
        rs[i]--;
        add(i);
    };
    vector<int> acs(q), was(q);
    auto memo = [&](int i){
        acs[i] = ac, was[i] = wa;
    };
    Mo mo(n,q);
    rep(i,q){
        int l, r; cin >> l >> r; l--;
        mo.insert(l,r);
    }
    mo.run(adl,adr,dll,dlr,memo);
    rep(i,q){
        out(acs[i],was[i]);
    }
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0