The Wall Gym - 101147C

 https://cn.vjudge.net/problem/Gym-101147C

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e2+9;
const int mod=1e9+7;

double x[maxn*100],y[maxn*100];
int n,m;
int p;
bool vis[maxn],visp[maxn*100];

double Dis(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}

vector<int>g[maxn];
int lin[maxn];
bool used[maxn];
bool dfs(int u)
{
    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i];
        if(!used[v])
        {
            used[v]=1;
            if(lin[v]==-1||dfs(lin[v]))
            {
                lin[v]=u;
                return 1;
            }
        }
    }
    return 0;
}

int hungary()
{
    int res=0;
    mem(lin,-1);
    for(int u=0;u<n;u++)
    {
        mem(used,0);
        if(dfs(u)) res++;
    }
    return res;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);
    freopen("wall.in","r",stdin);

    int T;
    //cin>>T;
    sfi(T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&p);
        for(int i=0;i<n+m;i++) g[i].clear(),vis[i]=0;
        for(int i=0;i<=p;i++) visp[i]=0;
        for(int i=0;i<p;i++)
        {
            scanf("%lf%lf",&x[i],&y[i]);
        }

        int ans=0;
        for(int i=0;i<p;i++)
        {
            if(Dis(x[i],y[i],(double)n/2.0,0)<=(double)n/2.0||(y[i]>m&&Dis(x[i],y[i],(double)n/2.0,m)>(double)n/2.0))
            {
                visp[i]=1;
                int idx=(int)x[i];
                if(!vis[idx])
                {
                    vis[idx]=1;
                    ans++;
                }
            }
        }

        for(int i=0;i<p;i++)
        {
            if(visp[i]) continue;
            int idx=(int)x[i];
            if(vis[idx]) continue;
            int idy=(int)y[i];
            for(int j=idy;j>=0;j--)
            {
                if(Dis(x[i],y[i],(double)n/2.0,j)>=(double)n/2.0)
                {
                    g[idx].pb(j+n);
                    break;
                }
            }
        }

        ans+=hungary();
        printf("%d\n",ans);

    }


    return 0;
}