oj.uz

Submission #689307

# Submission time Handle Problem Language Result Execution time Memory
689307 2023-01-28T06:29:06 Z EthanKim8683 Election (BOI18_election) C++17
100 / 100
 464 ms 30944 KB 
#include<bits/stdc++.h>
using namespace std;
using I=int;
using C=char;
const I N=500000;
C fans[N+1];
tuple<I,I,I,I,I>segs[2*N];
I n;
tuple<I,I,I,I,I>cmb(tuple<I,I,I,I,I>a,tuple<I,I,I,I,I>b){
  auto[ic1,it1,dc1,dt1,o1]=a;auto[ic2,it2,dc2,dt2,o2]=b;
  I di=min(ic1,it2);ic1-=di,it2-=di;
  I dt=min(dt1,dc2);dt1-=dt,dc2-=dt;
  I ic3=ic1+ic2,it3=it1+it2;
  I dc3=dc1+dc2,dt3=dt1+dt2;
  o1=min(o1,dt1),o2=min(o2,it2);
  I o3=o1+o2+min(dt1-o1,it2-o2);
  return{ic3,it3,dc3,dt3,o3};
}
void asn1(I i){
  get<0>(segs[i+n])++,get<2>(segs[i+n])++;
}
void asn2(I i){
  get<1>(segs[i+n])++,get<3>(segs[i+n])++,get<4>(segs[i+n])++;
}
void bld(){
  for(I i=n-1;i>0;i--)segs[i]=cmb(segs[i<<1],segs[i<<1|1]);
}
I qry(I l,I r){
  tuple<I,I,I,I,I>lrs={0,0,0,0,0},rrs={0,0,0,0,0};
  for(l+=n,r+=n;l<r;l>>=1,r>>=1){
    if(l&1)lrs=cmb(lrs,segs[l++]);
    if(r&1)rrs=cmb(segs[--r],rrs);
  }
  auto[ic,it,dc,dt,o]=cmb(lrs,rrs);
  return it+dt-o;
}
I main(){
  cin.tie(0)->sync_with_stdio(0);
  cin>>n;
  cin>>fans;
  for(I i=0;i<n;i++)fans[i]=='C'?asn1(i):asn2(i);
  bld();
  I q;cin>>q;
  while(q--){
    I l,r;cin>>l>>r,l--,r--;
    printf("%i\n",qry(l,r+1));
  }
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 41 ms 4276 KB Output is correct
7 Correct 41 ms 4272 KB Output is correct
8 Correct 44 ms 4244 KB Output is correct
9 Correct 38 ms 4248 KB Output is correct
10 Correct 36 ms 4212 KB Output is correct
11 Correct 43 ms 4296 KB Output is correct
12 Correct 39 ms 4400 KB Output is correct
13 Correct 45 ms 4356 KB Output is correct
14 Correct 48 ms 4372 KB Output is correct
15 Correct 43 ms 4300 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 41 ms 4276 KB Output is correct
7 Correct 41 ms 4272 KB Output is correct
8 Correct 44 ms 4244 KB Output is correct
9 Correct 38 ms 4248 KB Output is correct
10 Correct 36 ms 4212 KB Output is correct
11 Correct 43 ms 4296 KB Output is correct
12 Correct 39 ms 4400 KB Output is correct
13 Correct 45 ms 4356 KB Output is correct
14 Correct 48 ms 4372 KB Output is correct
15 Correct 43 ms 4300 KB Output is correct
16 Correct 386 ms 29920 KB Output is correct
17 Correct 397 ms 29560 KB Output is correct
18 Correct 440 ms 29788 KB Output is correct
19 Correct 326 ms 29336 KB Output is correct
20 Correct 394 ms 29048 KB Output is correct
21 Correct 464 ms 30912 KB Output is correct
22 Correct 389 ms 30820 KB Output is correct
23 Correct 446 ms 30944 KB Output is correct
24 Correct 389 ms 30652 KB Output is correct
25 Correct 382 ms 30172 KB Output is correct