oj.uz

답안 #931976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931976 2024-02-22T17:16:29 Z sleepntsheep 가로등 (APIO19_street_lamps) C++17
100 / 100
 1939 ms 44664 KB 
#include<stdio.h>
#include<stdlib.h>
#define N 300005


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],ff[N],fn[N],fp[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],ansp[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;
}

#include<string.h>
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;
    compar=cmprx;sort(o2,l,r);

    if(0){
    printf(" CDQ %d %d\n",l,r);
    for( int j=l;j<r;++j)
    {
        int I=o1[o2[j]];
        printf("        | %d %d %d %d (%c)\n",pq[I][0],pq[I][1],pq[I][2],pq[I][3],o2[j]>=m?'R':'L');
    }
    }

    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(ff,pq[I][2]+1);
            ansn[J]+=f_q(fn,pq[I][2]+1);
            ansp[J]+=f_q(fp,pq[I][2]+1);
        }
        else if(!~J&&o2[j]<m)
        {
            f_u(ff,abs(pq[I][2])+1,pq[I][2]);
            if(pq[I][2]>=0)f_u(fp,pq[I][2]+1,1);
            else f_u(fn,-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(ff,abs(pq[I][2])+1,-pq[I][2]);
            if(pq[I][2]>=0)f_u(fp,pq[I][2]+1,-1);
            else f_u(fn,-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<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);
    for(int i=0;0&&i<m;++i) printf("       | %d %d %d %d\n", pq[o1[i]][0],pq[o1[i]][1],pq[o1[i]][2],pq[o1[i]][3]);
    cdq(0,m);
    for(int i=0;i<qn;++i){
        if(ansn[i]<ansp[i])ans[i]-=q[i][2];
        printf("%d\n",-ans[i]);
        //printf("  %d %d\n",ansn[i],ansp[i]);
    }
}

Compilation message

street_lamps.cpp: In function 'int main()':
street_lamps.cpp:86:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 | int main(){scanf("%d%d%s",&n,&Q,s+1);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:89:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 | for(int i=1,a,b;i<=Q;++i){scanf("%s%d",op,&a);
      |                           ~~~~~^~~~~~~~~~~~~~
street_lamps.cpp:90:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 760 ms 35108 KB Output is correct
2 Correct 840 ms 35356 KB Output is correct
3 Correct 970 ms 35136 KB Output is correct
4 Correct 1474 ms 37000 KB Output is correct
5 Correct 1599 ms 38340 KB Output is correct
6 Correct 1544 ms 40072 KB Output is correct
7 Correct 674 ms 27144 KB Output is correct
8 Correct 722 ms 39240 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 5 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 1577 ms 40400 KB Output is correct
6 Correct 1939 ms 41340 KB Output is correct
7 Correct 1755 ms 37812 KB Output is correct
8 Correct 1032 ms 33256 KB Output is correct
9 Correct 431 ms 26868 KB Output is correct
10 Correct 466 ms 28500 KB Output is correct
11 Correct 479 ms 28664 KB Output is correct
12 Correct 1037 ms 32852 KB Output is correct
13 Correct 1054 ms 39268 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10844 KB Output is correct
2 Correct 3 ms 10680 KB Output is correct
3 Correct 4 ms 10712 KB Output is correct
4 Correct 5 ms 14852 KB Output is correct
5 Correct 1313 ms 33164 KB Output is correct
6 Correct 1511 ms 40472 KB Output is correct
7 Correct 1724 ms 44092 KB Output is correct
8 Correct 1814 ms 44664 KB Output is correct
9 Correct 1140 ms 41300 KB Output is correct
10 Correct 1185 ms 38140 KB Output is correct
11 Correct 1112 ms 41552 KB Output is correct
12 Correct 1191 ms 38208 KB Output is correct
13 Correct 1083 ms 41288 KB Output is correct
14 Correct 1181 ms 38432 KB Output is correct
15 Correct 954 ms 32900 KB Output is correct
16 Correct 983 ms 39340 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 1 ms 10844 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 760 ms 35108 KB Output is correct
9 Correct 840 ms 35356 KB Output is correct
10 Correct 970 ms 35136 KB Output is correct
11 Correct 1474 ms 37000 KB Output is correct
12 Correct 1599 ms 38340 KB Output is correct
13 Correct 1544 ms 40072 KB Output is correct
14 Correct 674 ms 27144 KB Output is correct
15 Correct 722 ms 39240 KB Output is correct
16 Correct 5 ms 14684 KB Output is correct
17 Correct 5 ms 14684 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 3 ms 10588 KB Output is correct
20 Correct 1577 ms 40400 KB Output is correct
21 Correct 1939 ms 41340 KB Output is correct
22 Correct 1755 ms 37812 KB Output is correct
23 Correct 1032 ms 33256 KB Output is correct
24 Correct 431 ms 26868 KB Output is correct
25 Correct 466 ms 28500 KB Output is correct
26 Correct 479 ms 28664 KB Output is correct
27 Correct 1037 ms 32852 KB Output is correct
28 Correct 1054 ms 39268 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 3 ms 10680 KB Output is correct
31 Correct 4 ms 10712 KB Output is correct
32 Correct 5 ms 14852 KB Output is correct
33 Correct 1313 ms 33164 KB Output is correct
34 Correct 1511 ms 40472 KB Output is correct
35 Correct 1724 ms 44092 KB Output is correct
36 Correct 1814 ms 44664 KB Output is correct
37 Correct 1140 ms 41300 KB Output is correct
38 Correct 1185 ms 38140 KB Output is correct
39 Correct 1112 ms 41552 KB Output is correct
40 Correct 1191 ms 38208 KB Output is correct
41 Correct 1083 ms 41288 KB Output is correct
42 Correct 1181 ms 38432 KB Output is correct
43 Correct 954 ms 32900 KB Output is correct
44 Correct 983 ms 39340 KB Output is correct
45 Correct 454 ms 32084 KB Output is correct
46 Correct 552 ms 32104 KB Output is correct
47 Correct 887 ms 33220 KB Output is correct
48 Correct 1638 ms 41496 KB Output is correct
49 Correct 528 ms 34588 KB Output is correct
50 Correct 522 ms 32520 KB Output is correct
51 Correct 548 ms 34640 KB Output is correct
52 Correct 613 ms 31016 KB Output is correct
53 Correct 631 ms 31056 KB Output is correct
54 Correct 643 ms 31224 KB Output is correct