結果
問題 | No.2338 Range AtCoder Query |
ユーザー | dyktr_06 |
提出日時 | 2023-06-02 21:57:54 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,353 bytes |
コンパイル時間 | 7,578 ms |
コンパイル使用メモリ | 317,412 KB |
実行使用メモリ | 161,904 KB |
最終ジャッジ日時 | 2024-06-08 22:59:56 |
合計ジャッジ時間 | 39,295 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,752 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | RE | - |
testcase_30 | TLE | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
ソースコード
#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 << ")"; returnos; }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);}};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);rep(i, q){ll l, r; cin >> l >> r; l--;mo.add(l, r);}rep(i, n) p[i]--;vector<P> res(q);vector<deque<ll>> submit(m);vll accnt(n);ll ac = 0, wa = 0;auto addL = [&](int i){if(s[i] == "AC"){submit[p[i]].push_front(-1);accnt[p[i]]++;if(accnt[p[i]] == 1) ac++;}else{if(submit[p[i]].empty()){submit[p[i]].push_front(1);}else{ll 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(s[i] == "AC"){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{ll t = submit[p[i]].back();if(t == -1){submit[p[i]].push_front(1);}else{submit[p[i]].pop_front();submit[p[i]].push_front(t + 1);}}}};auto eraseL = [&](int i){if(s[i] == "AC"){submit[p[i]].pop_front();accnt[p[i]]--;if(accnt[p[i]] == 0) ac--;}else{if(!submit[p[i]].empty()){ll 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(s[i] == "AC"){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{if(!submit[p[i]].empty()){ll t = submit[p[i]].back();submit[p[i]].pop_front();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();}