poj 2777 Count Color

Posted 2021-01-03

鏍囩锛?a href='http://www.mamicode.com/so/1/%e5%a4%9a%e9%87%8d' title='澶氶噸'>澶氶噸   鍘婚噸   while   鍖洪棿瑕嗙洊   cstring   poj 2777   ide   mem   鍒嗕韩   

鍜宧du5023涓€鏍蜂笉杩囪闂笉鍚屻€?/p>

 

 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define up rt,rt<<1,rt<<1|1
using namespace std;
const int M = 1e6+7;
int n,q;
int c[M<<2],ans[20000],cnt;
void pushdown(int rt,int l,int r){
    c[l]=c[r]=c[rt];c[rt]=0;
}
void build(int l,int r,int rt){
    c[rt]=0;
    if(l==r) return ;
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
}
void update(int L,int R,int l,int r,int rt,int v){
    if(L==l&&r==R){
        c[rt]=v;//杩欎釜鍖洪棿鏄暣涓鏌撹壊
        return ;
    }
    if(c[rt]) pushdown(up);//褰撹繖涓尯闂翠笉鏄暣涓細琚煋鑹查偅涔堝皢棰滆壊涓嬫斁
    int mid=(l+r)>>1;
    if(L<=mid) update(L,min(mid,R),lson,v);
    if(R>mid) update(max(L,mid+1),R,rson,v);
}
void query(int L,int R,int l,int r,int rt){
    //cout<<rt<<endl;
    if(l<=L&&R<=r&&c[rt]){//鏌ヨ鍖洪棿鏁翠釜琚繖涓尯闂磋鐩栦笖杩欎釜鍖洪棿鏈夐鑹插氨杩斿洖棰滆壊
        ans[++cnt]=c[rt];
        return ;
    }
    int mid=(l+r)>>1;
    if(L<=mid) query(L,min(mid,R),lson);
    if(R>mid) query(max(mid+1,L),R,rson);
}
int main(){
    int _;
    while(~scanf("%d%d%d",&n,&_,&q)){
        build(1,n,1);
        c[1]=1;cnt=0;memset(ans,0,sizeof(ans));
        while(q--){
            char s[10];int x,y,v;
            scanf("%s",s);
            if(s[0]==鈥?/span>C鈥?/span>){
                scanf("%d%d%d",&x,&y,&v);if(x>y) swap(x,y);
                update(x,y,1,n,1,v);
            }
            else{
                cnt=0;memset(ans,0,sizeof(ans));
                scanf("%d%d",&x,&y);if(x>y) swap(x,y);
                query(x,y,1,n,1);
                sort(ans+1,ans+cnt+1);
                int sz=unique(ans+1,ans+cnt+1)-ans-1;//鍘婚噸锛屽洜涓哄彲鑳芥壘鍒板緢澶氶噸澶嶆煋鑹插尯闂?/span>
                printf("%d
",sz);
            }
        }
    }
    return 0;
}

View Code