Gym-102141E

https://vjudge.net/problem/Gym-102141E

用set乱搞

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cmath>
#include<set>
#include<cstring>
#define inf 2147483647
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(int i=a;i<=b;++i)

using namespace std;
char s[N];
int T,kase;
struct node{
    int l,r;
    bool operator < (const node &b) const{
        if(r!=b.r) return r<b.r;
            return l<b.l;
    }
};

struct tree{
    set<node>s;
    void init(){
        s.clear();
    }
    void insert(int l,int r){
        s.insert({l,r});
    }
    void spilt(int x){
        auto res=*s.lower_bound({-,x});
        s.erase(res);
        if(x!=res.l) s.insert({res.l,x-});
        if(x!=res.r) s.insert({x+,res.r});
    }
    int query(int x){
        auto it=s.lower_bound({-,x});
        return (it->r)-(it->l)+;
    }
}a[];

void in(int &x){
    int y=;char c=getchar();x=;
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}
    x*=y;
}
void o(int x){
    if(x<){p('-');x=-x;}
    if(x>)o(x/);
    p(x%+'');
}

int main(){
    in(T);
    while(T--){
        scanf("%s",s);
        int n=strlen(s),op,q,x,l=;
        For(i,,)
            a[i].init();
        For(i,,n-)
            if(s[i]!=s[i-]){
                a[s[i-]-'A'].insert(l,i-);
                l=i;
            }
        a[s[n-]-'A'].insert(l,n-);
        in(q);
        printf("Case %d:\n",++kase);
        while(q--){
            in(op);in(x);
            if(op&)
                o(a[s[x]-'A'].query(x)),p('\n');
            else
                a[s[x]-'A'].spilt(x),s[x]='#';
        }
    }
    return ;
}