Forest

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

#define ll long long
#define ld long double
#define ii pair<int,int>
#define si pair<string,int>
#define iii pair<int,ii>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define msvs map<string,vs>
#define msi map<string,int>
#define mss map<string,int>
#define us unordered_set
#define um unordered_map
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define forall(i,a,b) for (int i=a;i<b;i++)
#define foreach(v,c) for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define N (1<<17)
#define M 1000000007
#define I 500000004
#define eps 1e-8

vector<pair<ll,ll>> f;

int main()
{
	cin.sync_with_stdio(false);
	int n; cin >> n;
	ll x,y; cin >> x >> y;
	for (int i = 0; i < n; i++) {
		ll xi,yi; cin >> xi >> yi;
		f.push_back(make_pair(xi,yi));
	}
	int count = n;
	for (int i = 0; i < n; i++) {
		pair<ll,ll> t = f[i];
		if (t.first-x > 0) {
			ld k = (ld)(t.second-y)/(t.first-x);
			ll d = (t.first-x)*(t.first-x)+(t.second-y)*(t.second-y);
			for (int j = 0; j < n; j++) {
				if (i == j) continue;
				pair<ll,ll> t2 = f[j];
				if (t2.first-x > 0) {
					ld k2 = (ld)(t2.second-y)/(t2.first-x);
					ll d2 = (t2.first-x)*(t2.first-x)+(t2.second-y)*(t2.second-y);
					if (d2 < d && abs(k-k2) < eps) {
						count--;
						break;
					}
				}
			}
		} else if (t.first-x < 0) {
			ld k = (ld)(t.second-y)/(t.first-x);
			ll d = (t.first-x)*(t.first-x)+(t.second-y)*(t.second-y);
			for (int j = 0; j < n; j++) {
				if (i == j) continue;
				pair<ll,ll> t2 = f[j];
				if (t2.first-x < 0) {
					ld k2 = (ld)(t2.second-y)/(t2.first-x);
					ll d2 = (t2.first-x)*(t2.first-x)+(t2.second-y)*(t2.second-y);
					if (d2 < d && abs(k-k2) < eps) {
						count--;
						break;
					}
				}
			}
		} else {
			if (t.first-x > 0) {
				for (int j = 0; j < n; j++) {
					if (i == j) continue;
					pair<ll,ll> t2 = f[j];
					if (t2.first-x > 0 && (t2.first-x) < (t.first-x)) {
						count--;
						break;
					}
				}
			} else {
				for (int j = 0; j < n; j++) {
					if (i == j) continue;
					pair<ll,ll> t2 = f[j];
					if (t2.first-x < 0 && (x-t2.first) < (x-t.first)) {
						count--;
						break;
					}
				}
			}
		}
	}
	cout << count << "\n";
	return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED