oj.uz

Submission #931977

# Submission time Handle Problem Language Result Execution time Memory
931977 2024-02-22T17:24:10 Z sleepntsheep Street Lamps (APIO19_street_lamps) C
100 / 100
 1836 ms 37200 KB 
#include<stdio.h>
#define N 300005
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,tune=native")

int abs(int x){return x<0?-x:x;}
unsigned X=12345;int rand_(){return(X*=3)>>1;}
int (*compar)(int,int);
void sort(int*aa,int l,int r){
    while(l<r){int i=l,j=l,k=r,tmp,p=aa[l+rand_()%(r-l)];
        while(j<k)switch(compar(aa[j],p)){case 0:++j;break;case -1:tmp=aa[j],aa[j]=aa[i],aa[i]=tmp,++i,++j;break;case 1:--k,tmp=aa[j],aa[j]=aa[k],aa[k]=tmp;break;}
        sort(aa,l,i);l=k;
    }
}


void f_u(int*t,int p,int k){ for(;p<N;p+=p&-p)t[p]+=k; }
int f_q(int*t,int p){int z=0;for(;p;p-=p&-p)z+=t[p];return z;}
int f_lb(int*t,int k){if(!k)return 0;int p=0,z=0;for(int j=1<<19;j>>=1;)if(p+j<N&&z+t[p+j]<k)z+=t[p+=j];return p+1;}

int f[2][N],p[1<<20][3],pn,q[1<<20][4],qn,n,Q;char s[N],op[7];
int pq[1<<21][4],m,ans[1<<19],ansn[1<<19];
int o1[1<<21],o2[1<<21];

void A(int a,int b,int t){if(a<1)a=1;if(b>n)b=n;p[pn][0]=a,p[pn][1]=b,p[pn++][2]=t;}

int cmprb(int i,int j){return pq[i][1]<pq[j][1]?1:(pq[i][1]>pq[j][1]?-1:(~pq[i][3]&&~pq[j][3]?0:(~pq[i][3]?1:~pq[j][3]?-1:0)));
}
int cmprx(int i,int j){
    i=o1[i],j=o1[j];
    int ai=pq[i][0],aj=pq[j][0];
    if(ai-aj)return ai<aj?-1:1;
    if(~pq[i][3]&&~pq[j][3])return 0;
    if(~pq[i][3])return 1;if(~pq[j][3])return -1;
    return 0;
}

void cdq(int l,int r){
    if(l+1>=r)return;
    int m=(l+r)>>1;
    cdq(l,m);cdq(m,r);
    for(int j=l;j<r;++j)o2[j]=j;
    sort(o2,l,r);
    for(int j=l;j<r;++j)
    {
        int I=o1[o2[j]],J=pq[I][3];
        if(~J&&o2[j]>=m){
            ans[J]+=f_q(f[0],pq[I][2]+1);
            ansn[J]+=f_q(f[1],pq[I][2]+1);
        }
        else if(!~J&&o2[j]<m)
        {
            f_u(f[0],abs(pq[I][2])+1,pq[I][2]);
            if(pq[I][2]>=0)f_u(f[1],pq[I][2]+1,1);
            else f_u(f[1],-pq[I][2]+1,-1);
        }
    }

    for(int j=l;j<r;++j)
    {
        int I=o1[o2[j]],J=pq[I][3];
        if(!~J&&o2[j]<m)
        {
            f_u(f[0],abs(pq[I][2])+1,-pq[I][2]);
            if(pq[I][2]>=0)f_u(f[1],pq[I][2]+1,-1);
            else f_u(f[1],-pq[I][2]+1,-(-1));
        }
    }
}

int main(){scanf("%d%d%s",&n,&Q,s+1);
for(int r=1;r<=n;++r)if(s[r]=='1'){int l=r;while(s[r]=='1')++r;A(l,r-1,0);}
for(int i=1;i<=n;++i)f_u(f[s[i]&1],i,1);
for(int i=1,a,b;i<=Q;++i){scanf("%s%d",op,&a);
    if(*op=='q'){scanf("%d",&b);q[qn][0]=a,q[qn][1]=--b,q[qn][2]=i;q[qn][3]=qn;++qn;}
    else{
        if(s[a]=='1')
        {
            int x=f_q(*f,a),l=f_lb(*f,x),r=f_lb(*f,x+1);
            A(l+1,r-1,-i);if(l+1<=a-1)A(l+1,a-1,i);if(a+1<=r-1)A(a+1,r-1,i);
        }
        else
        {
            int x=f_q(f[1],a),l=f_lb(f[1],x),r=f_lb(f[1],x+1);
            if(l==a-1&&a+1==r){ int X=f_q(*f,a),ll=f_lb(*f,X-1),rr=f_lb(*f,X+1);A(ll+1,a-1,-i);A(a+1,rr-1,-i);A(ll+1,rr-1,i); }
            else if(l==a-1) { int X=f_q(*f,a),ll=f_lb(*f,X-1); A(ll+1,a-1,-i);A(ll+1,a,i); }
            else if(a+1==r) { int X=f_q(*f,a),rr=f_lb(*f,X+1); A(a+1,rr-1,-i),A(a,rr-1,i); }
            else A(a,a,i);
        }
        f_u(f[s[a]&1],a,-1);s[a]^=1;f_u(f[s[a]&1],a,1);
    }
}for(int i=0;i<2;++i)for(int j=0;j<N;++j)f[i][j]=0;

for(int i=0;i<pn;++i)pq[i][0]=p[i][0],pq[i][1]=p[i][1],pq[i][2]=p[i][2],pq[i][3]=-1,o1[i]=i;
for(int i=pn,j=0;j<qn;++j,++i)pq[i][0]=q[j][0],pq[i][1]=q[j][1],pq[i][2]=q[j][2],pq[i][3]=q[j][3],o1[i]=i;
m=qn+pn;
    compar=cmprb;sort(o1,0,m);compar=cmprx;
    cdq(0,m);
    for(int i=0;i<qn;++i)printf("%d\n",-ans[i]+(!!ansn[i])*q[i][2]);
}

Compilation message

street_lamps.c: In function 'cmprx':
street_lamps.c:34:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   34 |     if(~pq[i][3])return 1;if(~pq[j][3])return -1;
      |     ^~
street_lamps.c:34:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   34 |     if(~pq[i][3])return 1;if(~pq[j][3])return -1;
      |                           ^~
street_lamps.c: In function 'main':
street_lamps.c:71:12: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 | int main(){scanf("%d%d%s",&n,&Q,s+1);
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.c:74:27: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 | for(int i=1,a,b;i<=Q;++i){scanf("%s%d",op,&a);
      |                           ^~~~~~~~~~~~~~~~~~~
street_lamps.c:75:18: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     if(*op=='q'){scanf("%d",&b);q[qn][0]=a,q[qn][1]=--b,q[qn][2]=i;q[qn][3]=qn;++qn;}
      |                  ^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 3 ms 12120 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 2 ms 12124 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 772 ms 32084 KB Output is correct
2 Correct 813 ms 32080 KB Output is correct
3 Correct 947 ms 32048 KB Output is correct
4 Correct 1434 ms 33900 KB Output is correct
5 Correct 1633 ms 34344 KB Output is correct
6 Correct 1563 ms 35988 KB Output is correct
7 Correct 630 ms 27552 KB Output is correct
8 Correct 648 ms 28740 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 5 ms 12212 KB Output is correct
3 Correct 5 ms 12200 KB Output is correct
4 Correct 3 ms 12128 KB Output is correct
5 Correct 1616 ms 36740 KB Output is correct
6 Correct 1836 ms 37200 KB Output is correct
7 Correct 1793 ms 33576 KB Output is correct
8 Correct 936 ms 28756 KB Output is correct
9 Correct 392 ms 22916 KB Output is correct
10 Correct 440 ms 23112 KB Output is correct
11 Correct 442 ms 23380 KB Output is correct
12 Correct 931 ms 27204 KB Output is correct
13 Correct 916 ms 28724 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 4 ms 12124 KB Output is correct
4 Correct 5 ms 12124 KB Output is correct
5 Correct 1284 ms 32276 KB Output is correct
6 Correct 1468 ms 33780 KB Output is correct
7 Correct 1729 ms 35136 KB Output is correct
8 Correct 1740 ms 37112 KB Output is correct
9 Correct 1093 ms 35156 KB Output is correct
10 Correct 1145 ms 32648 KB Output is correct
11 Correct 1150 ms 35120 KB Output is correct
12 Correct 1145 ms 32636 KB Output is correct
13 Correct 1133 ms 35104 KB Output is correct
14 Correct 1102 ms 32812 KB Output is correct
15 Correct 939 ms 27552 KB Output is correct
16 Correct 902 ms 28628 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 3 ms 12120 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 2 ms 12124 KB Output is correct
8 Correct 772 ms 32084 KB Output is correct
9 Correct 813 ms 32080 KB Output is correct
10 Correct 947 ms 32048 KB Output is correct
11 Correct 1434 ms 33900 KB Output is correct
12 Correct 1633 ms 34344 KB Output is correct
13 Correct 1563 ms 35988 KB Output is correct
14 Correct 630 ms 27552 KB Output is correct
15 Correct 648 ms 28740 KB Output is correct
16 Correct 5 ms 12124 KB Output is correct
17 Correct 5 ms 12212 KB Output is correct
18 Correct 5 ms 12200 KB Output is correct
19 Correct 3 ms 12128 KB Output is correct
20 Correct 1616 ms 36740 KB Output is correct
21 Correct 1836 ms 37200 KB Output is correct
22 Correct 1793 ms 33576 KB Output is correct
23 Correct 936 ms 28756 KB Output is correct
24 Correct 392 ms 22916 KB Output is correct
25 Correct 440 ms 23112 KB Output is correct
26 Correct 442 ms 23380 KB Output is correct
27 Correct 931 ms 27204 KB Output is correct
28 Correct 916 ms 28724 KB Output is correct
29 Correct 4 ms 12124 KB Output is correct
30 Correct 4 ms 12124 KB Output is correct
31 Correct 4 ms 12124 KB Output is correct
32 Correct 5 ms 12124 KB Output is correct
33 Correct 1284 ms 32276 KB Output is correct
34 Correct 1468 ms 33780 KB Output is correct
35 Correct 1729 ms 35136 KB Output is correct
36 Correct 1740 ms 37112 KB Output is correct
37 Correct 1093 ms 35156 KB Output is correct
38 Correct 1145 ms 32648 KB Output is correct
39 Correct 1150 ms 35120 KB Output is correct
40 Correct 1145 ms 32636 KB Output is correct
41 Correct 1133 ms 35104 KB Output is correct
42 Correct 1102 ms 32812 KB Output is correct
43 Correct 939 ms 27552 KB Output is correct
44 Correct 902 ms 28628 KB Output is correct
45 Correct 428 ms 27404 KB Output is correct
46 Correct 570 ms 27364 KB Output is correct
47 Correct 887 ms 26864 KB Output is correct
48 Correct 1608 ms 33476 KB Output is correct
49 Correct 490 ms 27220 KB Output is correct
50 Correct 516 ms 27256 KB Output is correct
51 Correct 507 ms 27560 KB Output is correct
52 Correct 582 ms 27500 KB Output is correct
53 Correct 581 ms 27348 KB Output is correct
54 Correct 581 ms 27588 KB Output is correct