POJ2777 线段树+LASY思想

来源：互联网发布：酷家乐云设计软件编辑：程序博客网时间：2024/06/05 09:22

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;const int dmax=301000;int c[dmax];bool p[50];void color(int x,int l,int r,int s,int t,int z){if (c[x]==z)return;if (l==s && r==t){c[x]=z;return;}if (c[x]!=-1){c[x*2]=c[x*2+1]=c[x];c[x]=-1;}int mid=(l+r)>>1;if (t<=mid){color(x*2,l,mid,s,t,z);}else{if (mid<s)color(x*2+1,mid+1,r,s,t,z);else{color(x*2,l,mid,s,mid,z);color(x*2+1,mid+1,r,mid+1,t,z);}}}void call(int x,int l,int r,int s,int t){if (c[x]!=-1){p[c[x]]=1;return;}int mid=(l+r)>>1;if (t<=mid){call(x*2,l,mid,s,t);}else{if (mid<s)call(x*2+1,mid+1,r,s,t);else{call(x*2,l,mid,s,mid);call(x*2+1,mid+1,r,mid+1,t);}}}int main(){int i,j,k,m,n,t,x,y,z,ans;char tmp;c[1]=1;scanf("%d%d%d",&n,&t,&m);getchar();for (i=1;i<=m;i++){tmp=getchar();if (tmp=='C'){scanf("%d%d%d",&x,&y,&z);if (x>y)swap(x,y);color(1,1,n,x,y,z);}else{ans=0;memset(p,0,sizeof(p));scanf("%d%d",&x,&y);if (x>y)swap(x,y);call(1,1,n,x,y);for (j=1;j<=t;j++)if (p[j])ans++;printf("%d\n",ans);}getchar();}return 0;}

0 2