Codeforces 707D Persistent Bookcase(离线dfs或在线主席树)

$离线O(q)的复杂度，先把每次操作都存起来，如果第i次是修改的，那么就i-1朝i建边，如果是op=4，那么就从第k次往第i次连边，然后从第0次开始dfs，每次就先修改O(1)求和，然后往下搜，然后回溯$

---

$在线做法是主席树，复杂度是O(qlogn)，n个节点，每个节点维护一个bitset，然后主席树的做法搞就行了，另外开个有m个节点都是1的bitset来与就行了$

---

代码1：

#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          1000005
#define   maxnode       205
#define   sigma_size    26
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-4;
const LL    mod    = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/ 

pii op[MAX];
vector<int> v[MAX];
int sum;
int a[1005][1005];
int flip[1005];
int row[1005];
int ans[MAX];
int n,m,q;
void dfs(int u){
    int flag=0;
    if(u){
        if(op[u].first==1){
            int x=op[u].second/10000;
            int y=op[u].second%10000;
            if(a[x][y]^flip[x]==0){
                a[x][y]^=1;
                row[x]++;
                sum++;
                flag=1;
            }
        }
        else if(op[u].first==2){
            int x=op[u].second/10000;
            int y=op[u].second%10000;
            if(a[x][y]^flip[x]==1){
                a[x][y]^=1;
                row[x]--;
                sum--;
                flag=1;
            }
        }
        else if(op[u].first==3){
            int x=op[u].second;
            sum=sum-row[x]+(m-row[x]);
            flip[x]^=1;
            row[x]=m-row[x];
            flag=1;
        }
        ans[u]=sum;
    }
    for(int i=0;i<v[u].size();i++){
        int x=v[u][i];
        dfs(x);
    }
    if(u&&flag){
        if(op[u].first==1){
            int x=op[u].second/10000;
            int y=op[u].second%10000;
            a[x][y]^=1;
            row[x]--;
            sum--;
        }
        else if(op[u].first==2){
            int x=op[u].second/10000;
            int y=op[u].second%10000;
            a[x][y]^=1;
            row[x]++;
            sum++;
        }
        else if(op[u].first==3){
            int x=op[u].second;
            sum=sum-row[x]+(m-row[x]);
            flip[x]^=1;
            row[x]=m-row[x];
        }
    }
}
int main(){
    while(cin>>n>>m>>q){
        for(int i=0;i<=n;i++) v[i].clear();
        for(int i=1;i<=q;i++){
            scanf("%d",&op[i].first);
            if(op[i].first==1||op[i].first==2){
                int a,b;
                scanf("%d%d",&a,&b);
                op[i].second=a*10000+b;
            }
            else scanf("%d",&op[i].second);
            if(op[i].first==4){
                v[op[i].second].push_back(i);
            }
            else v[i-1].push_back(i);
        }
        sum=0;
        mem(a,0);
        mem(row,0);
        mem(flip,0);
        dfs(0);
        for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
    }
    return 0;
}

---

代码2

#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <bitset>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          1000005
#define   maxnode       205
#define   sigma_size    26
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-4;
const LL    mod    = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/ 

struct Node{
    int l,r;
    int sum;
    bitset<1005> b;
}tr[100005*20];
bitset<1005> tmp;
int root[100005];
int sz;

void pushup(int k){
    tr[k].sum=tr[tr[k].l].sum+tr[tr[k].r].sum;
}
int build(int l,int r){
    int k=sz++;
    if(l==r){
        tr[k].sum=0;
        tr[k].b.reset();
        return k;
    }
    int mid=(l+r)/2;
    tr[k].l=build(l,mid);
    tr[k].r=build(mid+1,r);
    pushup(k);
    return k;
}


int update(int l,int r,int o,int pos,int num,int d){
    int k=sz++;
    tr[k]=tr[o];
    if(l==r){
        tr[k].b[num]=d;
        bitset<1005> ret;
        ret=(tr[k].b&tmp);
        //cout<<ret.count()<<endl;
        tr[k].sum=ret.count();
        //cout<<tr[k].sum<<endl;
        return k;
    }
    int mid=(l+r)/2;
    if(pos<=mid) tr[k].l=update(l,mid,tr[k].l,pos,num,d);
    else tr[k].r=update(mid+1,r,tr[k].r,pos,num,d);
    pushup(k);
    //cout<<tr[k].sum<<endl;
    return k;
}

int flip(int l,int r,int o,int pos){
    int k=sz++;
    tr[k]=tr[o];
    if(l==r){
        tr[k].b.flip();
        bitset<1005> ret;
        ret=(tr[k].b&tmp);
        tr[k].sum=ret.count();
        return k;
    }
    int mid=(l+r)/2;
    if(pos<=mid) tr[k].l=flip(l,mid,tr[k].l,pos);
    else tr[k].r=flip(mid+1,r,tr[k].r,pos);
    pushup(k);
    return k;
}
int main(){
    int n,m,q;
    while(cin>>n>>m>>q){
        sz=0;
        root[0]=build(1,n);
        tmp.reset();
        for(int i=1;i<=m;i++) tmp[i]=1;
        for(int i=1;i<=q;i++){
            int op;
            scanf("%d",&op);
            if(op==1){
                int a,b;
                scanf("%d%d",&a,&b);
                root[i]=update(1,n,root[i-1],a,b,1);
                printf("%d\n",tr[root[i]].sum);
            }
            else if(op==2){
                int a,b;
                scanf("%d%d",&a,&b);
                root[i]=update(1,n,root[i-1],a,b,0);
                printf("%d\n",tr[root[i]].sum);
            }
            else if(op==3){
                int a;
                scanf("%d",&a);
                root[i]=flip(1,n,root[i-1],a);
                printf("%d\n",tr[root[i]].sum);
            }
            else{
                int a;
                scanf("%d",&a);
                root[i]=root[a];
                printf("%d\n",tr[root[i]].sum);
            }
        }
    }
    return 0;
}