結果
問題 | No.2338 Range AtCoder Query |
ユーザー |
|
提出日時 | 2024-04-29 19:28:57 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 10,366 bytes |
コンパイル時間 | 4,189 ms |
コンパイル使用メモリ | 297,264 KB |
実行使用メモリ | 293,176 KB |
最終ジャッジ日時 | 2024-11-19 02:15:31 |
合計ジャッジ時間 | 84,858 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 TLE * 12 |
ソースコード
#line 1 "main.cpp"#pragma gcc optimize("O3")#define PROBLEM ""#line 2 "/root/AtCoder/Halc-Library/Template/Template.hpp"//https://tatyam.hatenablog.com/entry/2019/12/15/003634#include<bits/stdc++.h>using namespace std;using ll=long long;template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;using pll=pair<ll,ll>;const ll LINF=1LL<<60;#define _overload3(_1,_2,_3,name,...) name#define _overload4(_1,_2,_3,_4,name,...) name#define _rep1(i,n) for(ll i=0; i<(n); i++)#define _rep2(i,a,b) for(ll i=(a); i<(b); i++)#define _rep3(i,a,b,c) for(ll i=(a); i<(b); i+=(c))#define rep(...) _overload4(__VA_ARGS__,_rep3,_rep2,_rep1)(__VA_ARGS__)#define _rrep1(i,n) for(ll i=(n); i-->0;)#define _rrep2(i,a,b) for(ll i=(b); i-->(a);)#define rrep(...) _overload3(__VA_ARGS__,_rrep2,_rrep1)(__VA_ARGS__)#define each(i,...) for(auto&& i:__VA_ARGS__)#define all(i) begin(i),end(i)#define rall(i) rbegin(i),rend(i)template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return true;}else return false;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return true;}else return false;}template<class T> ll sum(const T &a){return accumulate(all(a),0LL);}template<class T> auto min(const T &a){return *min_element(all(a));}template<class T> auto max(const T &a){return *max_element(all(a));}inline int scan(){ return getchar(); }inline void scan(int &a){ scanf("%d", &a); }inline void scan(unsigned &a){ scanf("%u", &a); }inline void scan(long &a){ scanf("%ld", &a); }inline void scan(long long &a){ scanf("%lld", &a); }inline void scan(unsigned long long &a){ scanf("%llu", &a); }inline void scan(char &a){ cin >> a; }inline void scan(float &a){ scanf("%f", &a); }inline void scan(double &a){ scanf("%lf", &a); }inline void scan(long double &a){ scanf("%Lf", &a); }inline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } }inline void scan(char a[]){ scanf("%s", a); }inline void scan(string &a){ cin >> a; }template<class T> inline void scan(vector<T> &vec);template<class T, size_t size> inline void scan(array<T, size> &vec);template<class T, class L> inline void scan(pair<T, L> &p);template<class T, size_t size> inline void scan(T (&vec)[size]);template<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); }template<class T> inline void scan(deque<T> &vec){ for(auto &i : vec) scan(i); }template<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); }template<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }template<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); }template<class T> inline void scan(T &a){ cin >> a; }inline void in(){}template <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); }inline void print(){ putchar(' '); }inline void print(const bool &a){ printf("%d", a); }inline void print(const int &a){ printf("%d", a); }inline void print(const unsigned &a){ printf("%u", a); }inline void print(const long &a){ printf("%ld", a); }inline void print(const long long &a){ printf("%lld", a); }inline void print(const unsigned long long &a){ printf("%llu", a); }inline void print(const char &a){ printf("%c", a); }inline void print(const char a[]){ printf("%s", a); }inline void print(const float &a){ printf("%.15f", a); }inline void print(const double &a){ printf("%.15f", a); }inline void print(const long double &a){ printf("%.15Lf", a); }inline void print(const string &a){ for(auto&& i : a) print(i); }template<class T> inline void print(const vector<T> &vec);template<class T, size_t size> inline void print(const array<T, size> &vec);template<class T, class L> inline void print(const pair<T, L> &p);template<class T, size_t size> inline void print(const T (&vec)[size]);template<class T> inline void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){putchar(' '); print(*i); } }template<class T> inline void print(const deque<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){putchar(' '); print(*i); } }template<class T, size_t size> inline void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(''); print(*i); } }template<class T, class L> inline void print(const pair<T, L> &p){ print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i);} }template<class T> inline void print(const T &a){ cout << a; }inline int out(){ putchar('\n'); return 0; }template<class T> inline int out(const T &t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }using ld=long double;using ull=unsigned long long;using uint=unsigned int;using pii=pair<int,int>;using pdd=pair<ld,ld>;using tuplis=array<ll,3>;#define vec(type,name,...) vector<type> name(__VA_ARGS__);#define vv(type,name,h,...)vector<vector<type>> name(h,vector<type>(__VA_ARGS__));#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__; in(__VA_ARGS__)#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size); in(name)#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)template<class T> ld dsum(const T &a){return accumulate(all(a),0.0L);}const int INF=INT_MAX>>1;const ll MINF=1LL<<40;const ld DINF=numeric_limits<ld>::infinity();const int MODD=1000000007;const int MOD=998244353;const ld EPS=1e-9;const ld PI=3.1415926535897932;const ll four[]={0,1,0,-1,0};const ll eight[]={0,1,1,0,-1,-1,1,-1,0};ll intpow(ll a,ll b){ll ret=1;while(b){if(b&1)ret*=a;a*=a;b>>=1;}return ret;}int Yes(bool i=true){return out(i?"Yes":"No");}int No(bool i=true){return out(i?"No":"Yes");}#define len(x) ((int)(x).size())#define fi first#define se second#line 2 "/root/AtCoder/Halc-Library/DataStructure/Mo.hpp"template<class M>struct Mo{using T=typename M::T;int32_t backet;vector<int32_t> left,right,order;Mo(int32_t N,int32_t Q){order.resize(Q);backet=max<int32_t>(1,(double)(N)/max<double>(1,sqrt(Q*2.0/3)));iota(order.begin(),order.end(),0);}void add_query(int32_t lf,int32_t ri){left.emplace_back(lf);right.emplace_back(ri);}vector<T> run(){vector<T> answer(order.size());sort(order.begin(),order.end(),[&](int32_t a,int32_t b){int32_t ab=left[a]/backet,bb=left[b]/backet;if(ab!=bb)return ab<bb;if(ab&1)return right[a]<right[b];return right[a]>right[b];});int32_t nl=0,nr=0;for(int32_t i:order){while(nl>left[i]){nl--;M::add_left(nl);}while(right[i]>nr){M::add_right(nr);nr++;}while(nl<left[i]){M::delete_left(nl);nl++;}while(right[i]<nr){nr--;M::delete_right(nr);}answer[i]=M::rem();}return answer;}};#line 5 "main.cpp"void solve(){LL(N,M,Q);static vec(ll,P,N);static vec(bool,S,N,0);rep(i,N){string s;in(P[i],s);if(s=="AC")S[i]=1;P[i]--;}static vec(ll,ac,M,0);static vec(deque<ll>,sub,M);static ll ac_ans=0;static ll pena_ans=0;struct raq{using T=pll;static void add_left(int pos){ll p=P[pos];if(S[pos]){if(!ac[p])ac_ans++;else pena_ans-=sub[p].front();ac[p]++;sub[p].push_front(0);}else{if(sub[p].empty()||sub[p].front()==0){sub[p].push_front(0);}sub[p].front()++;if(ac[p]){pena_ans++;}}}static void delete_left(int pos){ll p=P[pos];if(S[pos]){sub[p].pop_front();ac[p]--;if(!ac[p]){ac_ans--;}else{pena_ans+=sub[p].front();}}else{sub[p].front()--;if(ac[p]){pena_ans--;}if(sub[p].front()==0){sub[p].pop_front();}}}static void add_right(int pos){ll p=P[pos];if(S[pos]){if(!ac[p]){ac_ans++;if(!sub[p].empty()){pena_ans+=sub[p].front();}}sub[p].push_back(0);ac[p]++;}else{if(sub[p].empty()||sub[p].back()==0){sub[p].push_back(0);}sub[p].back()++;}}static void delete_right(int pos){ll p=P[pos];if(S[pos]){sub[p].pop_back();ac[p]--;if(!ac[p]){ac_ans--;if(!sub[p].empty())pena_ans-=sub[p].front();}}else{sub[p].back()--;if(sub[p].back()==0)sub[p].pop_back();}}static T rem(){return pll(ac_ans,pena_ans);}};Mo<raq> mo(N,Q);rep(i,Q){LL(L,R);mo.add_query(L-1,R);}vector<pll> fin_ans=mo.run();for(auto &[a,p]:fin_ans){out(a,p);}}int main(){solve();return 0;}