【洛谷八连测R5】whzzt-Conscience

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100000+5;
inline void read(int &x){
    x=0; char ch=getchar();
    while(ch<‘0‘||ch>‘9‘) ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
}
int T,n,m,q,ans;
bool c1[maxn],c2[maxn];
struct node{
    int x,y;
    inline bool operator < (const node &j) const {
        return x==j.x? y<j.y:x<j.x;
    }
}e[maxn];
int main(){
    read(T);
    while(T--){
        read(n);read(m);read(q); ans=0;
        for(int i=1;i<=q;++i)
            read(e[i].x),read(e[i].y);
        sort(e+1,e+q+1);
        memset(c1,0,sizeof(c1));
        memset(c2,0,sizeof(c2));
        for(int i=1;i<=q;++i){
            if(c1[e[i].x]||c2[e[i].y]) continue;
            ans++; c1[e[i].x]=c2[e[i].y]=1;
        }
        printf("%d\n",ans);
    }
    return 0;
}