1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
  
#define ordered_set tree<int, null_type,std::less<int>, rb_tree_tag,tree_order_statistics_node_update> 
  
int n,m,k,q,a,b,d,c;
std::set<std::pair<int,int> >pla;
std::set<std::pair<int,int> >pla2;

int ur;
int ul;
int dr;
int dl;
int res=0;

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(NULL);
    std::cin>>n>>m>>k>>q;
    for(int i=0;i<k;i++){
        std::cin>>a>>b;
        pla.emplace(a,b);
    }
    for(int i=0;i<=q;i++){
        pla2=pla;
        bool finish=false;
        while(!finish){
            finish=true;
        for(auto x=pla2.begin();x!=pla2.end();){
            a=(*x).first;
            b=(*x).second;
            int up=pla2.contains(std::make_pair(a-1,b));
            int down=pla2.contains(std::make_pair(a+1,b));
            int right=pla2.contains(std::make_pair(a,b+1));
            int left=pla2.contains(std::make_pair(a,b-1));
            if((!up&&!down)||(!right&&!left)){
                res++;
                
                finish=false;
                auto y=x;
                x++;
                pla2.erase(y);
            }else
                x++;
        }
        }
        std::cout<<res<<"\n";
        res=0;
        if(i!=q){
            std::cin>>a>>b;
            if(!pla.contains(std::make_pair(a,b)))
            pla.emplace(a,b);
            else
            pla.erase(std::make_pair(a,b));
        }
            
    }
    

}