Taxing

input/code.cpp: In function 'bool PointInPolygon(const std::vector<PT>&, PT)':
input/code.cpp:24:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<p.size();i++){
                        ^
input/code.cpp:26:26: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if((p[i].y <=    q.y &&
                          ^
input/code.cpp: In function 'bool PointOnPolygon(const std::vector<PT>&, PT)':
input/code.cpp:49:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<p.size();i++)
                        ^

#include <vector>
#include <cmath>
#include <iostream>
using namespace std;
double EPS = 1e-12;
typedef double PTT;
struct PT{
  PTT x,y;
};

PT operator-(const PT& a, const PT& b){
  return {a.x-b.x,a.y-b.y};
}
PT operator+(const PT& a, const PT& b){
  return {a.x+b.x,a.y+b.y};
}

PT operator*(const PT& a, PTT b){
  return {a.x*b,a.y*b};
}

bool PointInPolygon(const vector<PT> &p, PT q){
  bool c=0;
  for(int i=0;i<p.size();i++){
    int j = (i+1)%p.size();
    if((p[i].y <=    q.y &&
           q.y <  p[j].y ||
        p[j].y <=    q.y &&
           q.y <  p[i].y)&&
       q.x < p[i].x +(p[j].x-p[i].x) * (q.y-p[i].y) / (p[j].y-p[i].y)) c= !c;
  }
  return c;
}

PTT dot(PT a, PT b){return a.x*b.x+a.y*b.y;}

PTT dist2(PT a, PT b){return dot(a-b,a-b);}

PT ProjectPointSegment(PT a, PT b, PT c){
  double r = dot(b-a,b-a);
  if(fabs(r)<EPS)return a;
  r = dot(c-a, b-a)/r;
  if(r<0) return a;
  if(r>1) return b;
  return a + (b-a)*r;
}

bool PointOnPolygon(const vector<PT> &p, PT q){
  for(int i=0;i<p.size();i++)
    if(dist2(ProjectPointSegment(p[i], p[(i+1)%p.size()], q), q) < EPS)return true;
  return false;
}

int main(){
 vector<PT> a;
 int n;
 cin>>n;
 a.resize(n);
 for(auto& it : a)cin>>it.x>>it.y;
 cin>>n;
 for(int i=0; i<n; ++i){
  PT v;
  cin>>v.x>>v.y;
  if(PointOnPolygon(a,v))cout<<"border\n";
  else if(PointInPolygon(a,v))cout<<"inside\n";
  else cout<<"outside\n";
 }
 return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED