oj.uz

답안 #1089577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089577 2024-09-16T17:19:01 Z noyancanturk Election (BOI18_election) C++17
100 / 100
 528 ms 49416 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back

const int lim=5e5+100;

struct{
  int tree[4*lim],sum[4*lim];
  int P,VAL; 
  void update(int l,int r,int node){
    if(l==r){
      tree[node]=sum[node]=VAL;
      return;
    }
    int mid=l+r>>1,child=node<<1;
    if(P<=mid)update(l,mid,child);
    else update(mid+1,r,child|1);
    tree[node]=min(tree[child]+sum[child|1],tree[child|1]);
    sum[node]=sum[child]+sum[child|1];
  }
  void update(int p,int val){
    P=p,VAL=val;
    update(0,lim-1,1);
  }
  int query(int l,int r,int node){
    if(r<=P)return tree[node];
    int mid=l+r>>1,child=node<<1;
    if(P<mid+1)return query(l,mid,child)+sum[child|1];
    int val1=tree[child]+sum[child|1],val2=query(mid+1,r,child|1);
    return min(val1,val2);
  }
  int query(int p){
    P=p;
    return query(0,lim-1,1);
  }
  int sumquery(int l,int r,int node){
    if(P<=l)return sum[node];
    int mid=l+r>>1,child=node<<1;
    if(mid<P)return sumquery(mid+1,r,child|1);
    return sumquery(l,mid,child)+sum[child|1];
  }
  int sumquery(int p){
    P=p;
    return sumquery(0,lim-1,1);
  }
}st;

struct{
  int tree[lim];
  void update(int p,int val){
    p++;
    while(p<lim){
      tree[p]+=val;
      p+=p&-p;
    }
  }
  int query(int p){
    p++;
    int res=0;
    while(p){
      res+=tree[p];
      p-=p&-p;
    }
    return res;
  }
  int query(int l,int r){
    return query(r)-query(l-1);
  }
}fw;

int main(){
  #ifdef Local
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
  #endif
  int n;
  cin>>n;
  string s;
  cin>>s;
  int m;
  cin>>m;
  int l[m],r[m],ans[m];
  vector<int>queries[n];
  for(int i=0;i<m;i++){
    cin>>l[i]>>r[i];
    l[i]--,r[i]--;
    queries[l[i]].pb(i);
  }
  stack<int>inds;
  for(int L=n-1;0<=L;L--){
    if(s[L]=='C'){
      st.update(L,1);
      if(inds.size()){
        st.update(inds.top(),-1);
        fw.update(inds.top(),-1);
        inds.pop();
      }
    }else{
      inds.push(L);
      fw.update(L,1);
    }
    for(int j:queries[L]){
      int R=r[j];
      int val0=fw.query(L,R);
      int val1=st.query(R);
      int val2=st.sumquery(R+1);
      ans[j]=val0-min(0,val1-val2);
    }
  }
  for(int i:ans){
    cout<<i<<"\n";
  }
}

Compilation message

election.cpp: In member function 'void<unnamed struct>::update(int, int, int)':
election.cpp:15:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   15 |     int mid=l+r>>1,child=node<<1;
      |             ~^~
election.cpp: In member function 'int<unnamed struct>::query(int, int, int)':
election.cpp:27:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |     int mid=l+r>>1,child=node<<1;
      |             ~^~
election.cpp: In member function 'int<unnamed struct>::sumquery(int, int, int)':
election.cpp:38:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |     int mid=l+r>>1,child=node<<1;
      |             ~^~

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct

Subtask #2
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 65 ms 6996 KB Output is correct
7 Correct 48 ms 6276 KB Output is correct
8 Correct 51 ms 6488 KB Output is correct
9 Correct 53 ms 6904 KB Output is correct
10 Correct 54 ms 6740 KB Output is correct
11 Correct 57 ms 7104 KB Output is correct
12 Correct 54 ms 6992 KB Output is correct
13 Correct 52 ms 6996 KB Output is correct
14 Correct 54 ms 6992 KB Output is correct
15 Correct 64 ms 6992 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 65 ms 6996 KB Output is correct
7 Correct 48 ms 6276 KB Output is correct
8 Correct 51 ms 6488 KB Output is correct
9 Correct 53 ms 6904 KB Output is correct
10 Correct 54 ms 6740 KB Output is correct
11 Correct 57 ms 7104 KB Output is correct
12 Correct 54 ms 6992 KB Output is correct
13 Correct 52 ms 6996 KB Output is correct
14 Correct 54 ms 6992 KB Output is correct
15 Correct 64 ms 6992 KB Output is correct
16 Correct 477 ms 48152 KB Output is correct
17 Correct 393 ms 41956 KB Output is correct
18 Correct 452 ms 44300 KB Output is correct
19 Correct 451 ms 46536 KB Output is correct
20 Correct 514 ms 47336 KB Output is correct
21 Correct 500 ms 49416 KB Output is correct
22 Correct 528 ms 48396 KB Output is correct
23 Correct 511 ms 47876 KB Output is correct
24 Correct 482 ms 47728 KB Output is correct
25 Correct 466 ms 47224 KB Output is correct