結果

問題 No.2338 Range AtCoder Query
ユーザー dyktr_06dyktr_06
提出日時 2023-06-02 22:55:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 9,714 bytes
コンパイル時間 8,175 ms
コンパイル使用メモリ 312,076 KB
実行使用メモリ 32,848 KB
最終ジャッジ日時 2023-08-28 05:16:11
合計ジャッジ時間 71,864 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 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 3 ms
4,376 KB
testcase_07 AC 3 ms
4,376 KB
testcase_08 AC 3 ms
4,376 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 1,736 ms
21,992 KB
testcase_12 AC 1,994 ms
22,596 KB
testcase_13 AC 2,262 ms
22,292 KB
testcase_14 AC 2,050 ms
22,516 KB
testcase_15 AC 2,430 ms
23,644 KB
testcase_16 AC 3,806 ms
30,860 KB
testcase_17 AC 3,892 ms
30,964 KB
testcase_18 AC 3,886 ms
30,888 KB
testcase_19 TLE -
testcase_20 TLE -
testcase_21 AC 3,944 ms
30,972 KB
testcase_22 AC 3,900 ms
30,872 KB
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 AC 95 ms
26,488 KB
testcase_27 AC 53 ms
23,584 KB
testcase_28 AC 61 ms
24,632 KB
testcase_29 AC 3,713 ms
31,084 KB
testcase_30 AC 3,899 ms
30,888 KB
testcase_31 AC 671 ms
32,848 KB
testcase_32 AC 635 ms
32,784 KB
testcase_33 AC 234 ms
30,684 KB
testcase_34 AC 229 ms
30,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct Mo{
    int n;
    vector<pair<int, int>> lr;

    Mo(const int &n) : n(n) {}

    /* [l, r) */
    void add(const int &l,  const int &r){
        lr.push_back({l, r});
    }

    template <typename AL, typename AR, typename EL, typename ER, typename O>
    void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out){
        int q = (int) lr.size();
        int border = max<int>(1, 1.0 * n / max<double>(1.0, sqrt(q * 2.0 / 3.0)));
        vector<int> ord(q);
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](int a, int b){
            int ablock = lr[a].first / border, bblock = lr[b].first / border;
            if(ablock != bblock){
                return ablock < bblock;
            }
            return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;
        });
        int l = 0, r = 0;
        for(const auto &k : ord){
            while(l > lr[k].first) add_left(--l);
            while(r < lr[k].second) add_right(r++);
            while(l < lr[k].first) erase_left(l++);
            while(r > lr[k].second) erase_right(--r);
            out(k);
        }
    }

    template <typename A, typename E, typename O>
    void build(const A &add, const E &erase, const O &out){
        build(add, add, erase, erase, out);
    }
};

template <typename T>
struct OriginalDeque{
    int l = 1, r = 0;
    vector<T> L, R;
    OriginalDeque(){
    }

    void push_front(int v){
        if(l <= 1){
            if(L.size() == -l + 1){
                L.push_back(v);
            }else{
                L[-l + 1] = v;
            }
        }else{
            R[l - 2] = v;
        }
        l--;
    }

    void pop_front(){
        l++;
    }

    T front(){
        if(l <= 0){
            return L[-l];
        }else{
            return R[l - 1];
        }
    }

    void push_back(int v){
        if(r < 0){
            L[-r - 1] = v;
        }else{
            if(R.size() == r){
                R.push_back(v);
            }else{
                R[r] = v;
            }
        }
        r++;
    }

    void pop_back(){
        r--;
    }

    T back(){
        if(r <= 0){
            return L[-r];
        }else{
            return R[r - 1];
        }
    }

    bool empty(){
        return (r - l + 1) == 0;
    }
};

ll n, m, q;
vll p;
vst s;

void input(){
    in(n, m, q);
    p.resize(n);
    s.resize(n);
    rep(i, n){
        in(p[i], s[i]);
    }
}

void solve(){
    Mo mo(n);
    vector<bool> sb(n);
    rep(i, n){
        if(s[i] == "AC") sb[i] = 1;
        else sb[i] = 0;
    }
    rep(i, q){
        int l, r; cin >> l >> r; l--;
        mo.add(l, r);
    }
    rep(i, n) p[i]--;

    vector<pair<int, int>> res(q);
    vector<OriginalDeque<int>> submit(m);
    vi accnt(m);
    int ac = 0, wa = 0;
    auto addL = [&](int i){
        if(sb[i]){
            accnt[p[i]]++;
            if(accnt[p[i]] == 1){
                ac++;
            }else{
                if(!submit[p[i]].empty()){
                    int t = submit[p[i]].front();
                    if(t != -1) wa -= t;
                }
            }
            submit[p[i]].push_front(-1);
        }else{
            if(submit[p[i]].empty()){
                submit[p[i]].push_front(1);
            }else{
                int t = submit[p[i]].front();
                if(t == -1){
                    submit[p[i]].push_front(1);
                }else{
                    submit[p[i]].pop_front();
                    submit[p[i]].push_front(t + 1);
                }
            }
            if(accnt[p[i]] >= 1) wa++;
        }
    };
    auto addR = [&](int i){
        if(sb[i]){
            accnt[p[i]]++;
            if(accnt[p[i]] == 1){
                ac++;
                if(!submit[p[i]].empty()){
                    wa += submit[p[i]].front();
                }
            }
            submit[p[i]].push_back(-1);
        }else{
            if(submit[p[i]].empty()){
                submit[p[i]].push_back(1);
            }else{
                int t = submit[p[i]].back();
                if(t == -1){
                    submit[p[i]].push_back(1);
                }else{
                    submit[p[i]].pop_back();
                    submit[p[i]].push_back(t + 1);
                }
            }
        }
    };
    auto eraseL = [&](int i){
        if(sb[i]){
            submit[p[i]].pop_front();
            accnt[p[i]]--;
            if(accnt[p[i]] == 0){
                ac--;
            }else{
                if(!submit[p[i]].empty()){
                    int t = submit[p[i]].front();
                    if(t != -1) wa += t;
                }
            }
        }else{
            int t = submit[p[i]].front();
            submit[p[i]].pop_front();
            if(t - 1 >= 1) submit[p[i]].push_front(t - 1);
            if(accnt[p[i]] >= 1) wa--;
        }
    };
    auto eraseR = [&](int i){
        if(sb[i]){
            submit[p[i]].pop_back();
            accnt[p[i]]--;
            if(accnt[p[i]] == 0){
                ac--;
                if(!submit[p[i]].empty()){
                    wa -= submit[p[i]].front();
                }
            }
        }else{
            int t = submit[p[i]].back();
            submit[p[i]].pop_back();
            if(t - 1 >= 1) submit[p[i]].push_back(t - 1);
        }
    };
    auto output = [&](int q){
        res[q] = {ac, wa};
    };
    mo.build(addL, addR, eraseL, eraseR, output);
 
    for(auto [x, y] : res){
        out(x, y);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    input();
    solve();
}
0