結果
| 問題 |
No.2338 Range AtCoder Query
|
| コンテスト | |
| ユーザー |
 woodywoody
|
| 提出日時 | 2023-06-03 00:39:25 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3,723 ms / 4,000 ms |
| コード長 | 8,330 bytes |
| コンパイル時間 | 6,176 ms |
| コンパイル使用メモリ | 279,856 KB |
| 実行使用メモリ | 29,680 KB |
| 最終ジャッジ日時 | 2024-12-29 01:46:33 |
| 合計ジャッジ時間 | 64,518 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 34 |
ソースコード
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) printf("%d %d\n",p.fi,p.se);
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif
#ifdef MY_LOCAL_DEBUG
class CTimer {
const std::chrono::time_point<std::chrono::system_clock> start;
std::int64_t limit_microsec = 0;
public:
CTimer();
void set(std::int64_t time_microsec);
bool elapsed() const;
ld GetClocksMagni() const;
std::int64_t getMicrosec() const;
};
#else
class CTimer {
static const std::uint64_t ClocksPerMicrosec;
const std::uint64_t start_clocks;
std::uint64_t limit_clocks;
std::uint64_t getClocks() const;
public:
CTimer();
void set(std::int64_t time_microsec);
bool elapsed() const;
ld GetClocksMagni() const;
std::int64_t getMicrosec() const;
};
#endif
#ifdef MY_LOCAL_DEBUG
using namespace std::chrono;
CTimer::CTimer()
: start(system_clock::now()) {
}
void CTimer::set(std::int64_t time_microsec) {
limit_microsec += time_microsec;
}
bool CTimer::elapsed() const {
return getMicrosec() >= limit_microsec;
}
std::int64_t CTimer::getMicrosec() const {
return duration_cast<microseconds>(system_clock::now() - start).count();
}
ld CTimer::GetClocksMagni() const {
ld ret = (ld)(limit_microsec - getMicrosec()) / limit_microsec;
return ret;
}
#else
const std::uint64_t CTimer::ClocksPerMicrosec = 2987;
std::uint64_t CTimer::getClocks() const {
unsigned int lo, hi;
__asm__ volatile ("rdtsc" : "=a" (lo), "=d" (hi));
return ((std::uint64_t)hi << 32) | lo;
}
CTimer::CTimer()
: start_clocks(getClocks()), limit_clocks(start_clocks) {
}
void CTimer::set(std::int64_t time_microsec) {
limit_clocks += time_microsec * ClocksPerMicrosec;
}
bool CTimer::elapsed() const {
return getClocks() >= limit_clocks;
}
std::int64_t CTimer::getMicrosec() const {
return (getClocks() - start_clocks) / ClocksPerMicrosec;
}
ld CTimer::GetClocksMagni() const {
ld ret = (ld)(limit_clocks - getClocks()) / (limit_clocks-start_clocks);
return ret;
}
#endif
struct state{
int l,r,i;
state(int l=0,int r=0,int i=0) : l(l),r(r),i(i) {}
bool operator<(state const &ot) const{
return r < ot.r;
}
};
void solve(){
int n,m,q; cin>>n>>m>>q;
vi p(n);
vs s(n);
vi part(m,1);
rep(i,n){
// scanf("%d",&p[i]);
cin>>p[i];
p[i]--;
cin>>s[i];
if (s[i]=="AC") part[p[i]]++;
}
// rep(i,n){
// cin>>p[i],p[i]--;
// cin>>s[i];
// }
vpii ans(q);
ll D = ceill((long double)n/sqrtl((long double)q));
int maxc = n/D;
vector<vector<state>> pock(maxc+1);
rep(i,q){
int l,r; cin>>l>>r;
l--; r--;
pock[l/D].pb(state(l,r,i));
}
// ll now=0;
ll kind_ac = 0;
ll sum_wa = 0;
vi cnt_ac(m);
vvi cnt_wa(m);
rep(i,m) cnt_wa[i] = vi(part[i]);
vi wl(m),wr(m);
auto add = [&](int l,int r,int type) -> pii{
int x;
if (type == 0){
x = --l;
}else{
x = ++r;
}
int px = p[x];
if (s[x]=="AC"){
if (++cnt_ac[px]==1){
kind_ac++;
}
if (type==0){
if (cnt_ac[px]>1) sum_wa -= cnt_wa[px][wl[px]];
wl[px]--;
}else{
if (cnt_ac[px]==1) sum_wa += cnt_wa[px][wl[px]];
wr[px]++;
}
}else{
if (type==0){
if (cnt_ac[px]) sum_wa++;
cnt_wa[px][wl[px]]++;
}else{
cnt_wa[px][wr[px]]++;
}
}
return {l,r};
};
auto del = [&](int l,int r,int type) -> pii{
int x;
if (type == 0){
x = l++;
}else{
x = r--;
}
int px = p[x];
if (s[x]=="AC"){
if (--cnt_ac[px]==0){
kind_ac--;
}
if (type==0){
wl[px]++;
if (cnt_ac[px]>0) sum_wa += cnt_wa[px][wl[px]];
}else{
wr[px]--;
if (cnt_ac[px]==0) sum_wa -= cnt_wa[px][wl[px]];
}
}else{
if (type==0){
cnt_wa[px][wl[px]]--;
if (cnt_ac[px]>0) sum_wa--;
}else{
cnt_wa[px][wr[px]]--;
}
}
return {l,r};
};
auto to = [&](int stl,int str,int gol,int gor){
int x = gol - stl;
int y = gor - str;
while(x != 0 || y != 0){
if (y > 0){
pii p = add(stl,str,1);
stl = p.fi;
str = p.se;
y--;
}else if (y < 0){
pii p = del(stl,str,1);
stl = p.fi;
str = p.se;
y++;
}
if (x > 0){
pii p = del(stl,str,0);
stl = p.fi;
str = p.se;
x--;
}else if(x < 0){
pii p = add(stl,str,0);
stl = p.fi;
str = p.se;
x++;
}
}
};
int l=0,r=0;
add(0,-1,1);
rep(i,maxc+1){
if (i%2 == 0){
sort(rng(pock[i]));
}else{
sort(rrng(pock[i]));
}
fore(y , pock[i]){
to(l,r,y.l,y.r);
ans[y.i].fi = kind_ac;
ans[y.i].se = sum_wa;
l = y.l;
r = y.r;
}
}
rep(i,q) coutp(ans[i]);
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
CTimer timer;
int t = 1;
//cin>>t;
rep(i,t){
solve();
}
show(timer.getMicrosec());
return 0;
}