codeforces--707D. Persistent Bookcase

cf 707D

题解

将每个操作视为一个结点，从而可以构造一棵树，查询则是从根出发遍历整棵树，回溯的过程中不要忘记修改回原来的状态。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1000 + 5;
const int maxq = 100000 + 5;

int  n, m, q;
bool bookcase[maxn][maxn], vis[maxq];
int ans[maxq];
int op[maxq], x[maxq], y[maxq];
int sum;
vector<int> g[maxq];

void dfs(int u){
    if(op[u] == 1){
        if(!bookcase[x[u]][y[u]]) vis[u] = true, bookcase[x[u]][y[u]] = true, sum++;
        ans[u] = sum;
    }
    else if(op[u] == 2){
        if(bookcase[x[u]][y[u]])  vis[u] = true, bookcase[x[u]][y[u]] = false, sum--;
        ans[u] = sum;
    }
    else if(op[u] == 3){
        for(int i = 1; i <= m; ++i){
            if(bookcase[x[u]][i]) bookcase[x[u]][i] = 0, sum--;
            else bookcase[x[u]][i] = 1, sum++;
        }
        ans[u] = sum;
    }
    else if(op[u] == 4){
        ans[u] = ans[x[u]];
    }

    for(int i = 0; i < (int)g[u].size(); ++i) dfs(g[u][i]);

    if(op[u] == 1){
        if(bookcase[x[u]][y[u]]  && vis[u]) bookcase[x[u]][y[u]] = 0, sum--;
    }
    else if(op[u] == 2){
        if(!bookcase[x[u]][y[u]] && vis[u]) bookcase[x[u]][y[u]] = 1, sum++;
    }
    else if(op[u] == 3){
        for(int i = 1; i <= m; ++i){
            if(bookcase[x[u]][i]) bookcase[x[u]][i] = 0, sum--;
            else bookcase[x[u]][i] = 1, sum++;
        }
    }

}

int main(){
#ifdef LOCAL
freopen("data.in", "r", stdin);
#endif // LOCAL

    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m >> q;
    for(int i = 1; i <= q; ++i){
        cin >> op[i] >> x[i];
        if(op[i] < 3) cin >> y[i];
        if(op[i] == 4) g[x[i]].push_back(i);
        else g[i - 1].push_back(i);
    }
    dfs(0);

    for(int i = 1; i <= q; ++i) cout << ans[i] << endl;

    return 0;
}