[JSOI2018]战争(凸包)

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
const ll N=1e5+10;
struct Node
{
    ll x,y;
    Node operator - (Node A) {return (Node){x-A.x,y-A.y};}
    Node operator + (Node A) {return (Node){x+A.x,y+A.y};}
    ll operator * (Node A) const {return x*A.y-y*A.x;}
    ll len() const {return x*x+y*y;}
}A[N],C1[N],C2[N],s1[N],s2[N],bs;
ll cmp1(const Node&A,const Node&B) {return A.y<B.y||(A.y==B.y&&A.x<B.x);}
ll cmp2(const Node&A,const Node&B) {return A*B>0||(A*B==0&&A.len()<B.len());}
ll n,m,sta[N],top,q,tot;
void Convex(Node *A,ll &n)
{
    sort(A+1,A+n+1,cmp1);
    bs=A[1];sta[top=1]=1;
    for(ll i=1;i<=n;i++) A[i]=A[i]-bs;
    sort(A+2,A+n+1,cmp2);
    for(ll i=2;i<=n;sta[++top]=i,i++)
        while(top>=2&&(A[i]-A[sta[top-1]])*(A[sta[top]]-A[sta[top-1]])>=0) top--;
    for(ll i=1;i<=top;i++) A[i]=A[sta[i]]+bs;
    n=top;A[n+1]=A[1];
}
void Minkowski()
{
    for(ll i=1;i<n;i++) s1[i]=C1[i+1]-C1[i];s1[n]=C1[1]-C1[n];
    for(ll i=1;i<m;i++) s2[i]=C2[i+1]-C2[i];s2[m]=C2[1]-C2[m];
    A[tot=1]=C1[1]+C2[1];
    ll p1=1,p2=1;
    while(p1<=n&&p2<=m) ++tot,A[tot]=A[tot-1]+(s1[p1]*s2[p2]>=0?s1[p1++]:s2[p2++]);
    while(p1<=n) ++tot,A[tot]=A[tot-1]+s1[p1++];
    while(p2<=m) ++tot,A[tot]=A[tot-1]+s2[p2++];
}
ll in(Node a)
{
    if(a*A[1]>0||A[tot]*a>0) return 0;
    ll ps=lower_bound(A+1,A+tot+1,a,cmp2)-A-1;
    return (a-A[ps])*(A[ps%tot+1]-A[ps])<=0;
}
int main()
{
    cin>>n>>m>>q;
    for(ll i=1;i<=n;i++)
        scanf("%lld%lld",&C1[i].x,&C1[i].y);
    Convex(C1,n);
    for(ll i=1;i<=m;i++)
    {
        scanf("%lld%lld",&C2[i].x,&C2[i].y);
        C2[i].x=-C2[i].x;C2[i].y=-C2[i].y;
    }
    Convex(C2,m);
    Minkowski();
    Convex(A,tot);
    bs=A[1];for(ll i=tot;i>=1;i--) A[i]=A[i]-A[1];
    while(q--)
    {
        scanf("%lld%lld",&A[0].x,&A[0].y);
        printf("%lld\n",in(A[0]-bs));
    }
    return 0;
}