Submission #392884

#	Time	Username	Problem	Language	Result	Execution time	Memory
392884		codebuster_10	Election (BOI18_election)	C++17	0 / 100	3 ms	1484 KiB

election

#include <bits/stdc++.h>
 
using namespace std ;
 
#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
 
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue
 
#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
 
template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}
 
void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}
using AR = array<int,2> ;
 
int N;	
string S; 
 
template<class T> struct SEGTREE1 { 
  public:  
    const T ID = {0,0}; 
    int size ;
    vector<T> seg ;
    void build(int x, int lx, int rx){
    	int now = 0, removed = 0;
    	for(int i = rx - 1; i >= lx; --i){
    		if(S[i] == 'T'){
    			if(now) now--;
    			else removed++;
    		}else if(S[i] == 'C'){
    			now++;
    		}
    	}
    	seg[x] = {now, removed};
    	if(rx - lx == 1) return;
    	int mid = (rx + lx)/2 ;
    	build(2 * x + 1, lx, mid);
    	build(2 * x + 2, mid, rx);
    }
    void init(){ 
      size = 1 ;
      while(size < N) size *= 2 ; 
      N = size;
      while(sz(S) < N) S.pb('#');
      seg.assign(2*size, ID); 
      build(0, 0, size);
    }
    
    void query(int l, int r, int x, int lx, int rx,vt<AR> &v) { 
      if( lx >= r || l >= rx )	return ;
      if( lx >= l && rx <= r){
      	v.pb({lx,x});	return ;
      }
      int mid = (rx + lx)/2 ;
    	query(l, r, 2 * x + 1, lx, mid, v);
    	query(l, r, 2 * x + 2, mid, rx, v);
    }
    AR query(int l, int r, int cap) { // query of [l,r)
    	vt<AR> v;
      query(l, r, 0, 0, size, v);
      int ans = 0;
      sort(allr(v));
      for(auto a : v){
      	int x = a[1];
      	if(cap >= seg[x][1]){
      		cap -= seg[x][1];
      		cap += seg[x][0];
      	}else{
      		ans += seg[x][1] - cap ;
      		cap = seg[x][0];
      	}
      }
      return {ans,cap};
    }
};
SEGTREE1<AR> st1;

struct node{
	vt<int> LR,RL;
	int now = 0;// when movinf L -> R
}EMPTY;

template<class T> struct SEGTREE2 { 
  public:  
    const T ID = EMPTY; 
    int size ;
    vector<T> seg ;
    void build(int x, int lx, int rx){
    	int now = 0;
    	for(int i = lx; i < rx; ++i){
    		if(S[i] == 'T'){
    			if(now) now--;
    			else seg[x].LR.pb(i);
    		}else if(S[i] == 'C'){
    			now++;
    		}
    	}
    	seg[x].now = now;
    	now = 0;
    	auto found = [&](int i){
    		int j = LB(all(seg[x].LR),i) - seg[x].LR.begin();
    		if(j == sz(seg[x].LR)) return false;
    		return (seg[x].LR[j] == i);
    	};
    	for(int i = rx - 1; i >= lx; --i){
    		if(found(i)) continue;
    		if(S[i] == 'T'){
    			if(now) now--;
    			else seg[x].RL.pb(i);
    		}else if(S[i] == 'C'){
    			now++;
    		}
    	}
    	reverse(all(seg[x].RL));
    	seg[x].RL.pb(rx);
    	if(rx - lx == 1) return;
    	int mid = (rx + lx)/2 ;
    	build(2 * x + 1, lx, mid);
    	build(2 * x + 2, mid, rx);
    }
    void init(){ 
      size = N; 
      seg.assign(2*size, ID); 
      build(0, 0, size);
    }
    void query(int l, int r, int x, int lx, int rx,vt<AR> &v) { 
      if( lx >= r || l >= rx )	return ;
      if( lx >= l && rx <= r){
      	v.pb({lx,x});	return ;
      }
      int mid = (rx + lx)/2 ;
    	query(l, r, 2 * x + 1, lx, mid, v);
    	query(l, r, 2 * x + 2, mid, rx, v);
    }
    int query(int l, int r) { 
    	vt<AR> v;
      query(l, r, 0, 0, size, v) ;
      sort(all(v));
      vt<int> deleted(sz(v),0);
      int ans = 0, cap = 0;
      f(i,0,sz(v)){
      	int x = v[i][1];
      	deleted[i] = min(cap,sz(seg[x].LR));
      	if(cap < sz(seg[x].LR)){
      		ans += sz(seg[x].LR) - cap;
      		cap = 0;
      	}
      	ans += seg[x].now;
      }
      cap = 0;
      for(int i = sz(v) - 1; i >= 0; --i){
      	int x = v[i][1], d = deleted[i];
      	int j = UB(all(seg[x].RL),seg[x].LR[d-1]) - seg[x].RL.begin();
      	int to_be_done = sz(seg[x].RL) - j - 1;
      	if(cap >= to_be_done){
      		cap -= to_be_done;
      	}else{
      		ans += to_be_done - cap; cap = 0;
      	}
      	int r = seg[x].RL[j] - 1;
      	int l = v[i][0];
      	auto a = st1.query(l,r,cap);
      	ans += a[0], cap = a[1]; 
      }
      return ans;
    }
};

signed main(){
  setIO() ;
  rd(N);
 	rd(S);
  st1.init();
  SEGTREE2<node> st2;
  st2.init();
  int q; rd(q);
  while(q--){
  	int l,r; rd(l,r); --l,--r;
  	cout << st2.query(l,r) << endl ;
  }
}

• Subtask 1: 0 / 28
• Subtask 2: 0 / 54
• Subtask 3: 0 / 18