백준 9610 c++

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void input_A(vector<pair<int, int>>& A)
{
	int N, i, x, y;

	cin >> N;
	for (i = 0; i < N; i++)
	{
		cin >> x >> y;
		A.push_back({ x, y });
	}

	return;
}

void find_answer(vector<pair<int, int>>& A)
{
	int i, x, y;
	int Q1 = 0, Q2 = 0, Q3 = 0, Q4 = 0, AXIS = 0;

	for (i = 0; i < A.size(); i++)
	{
		x = A[i].first;
		y = A[i].second;
		if (x > 0 && y > 0)
		{
			Q1++;
		}
		else if (x < 0 && y > 0)
		{
			Q2++;
		}
		else if (x < 0 && y < 0)
		{
			Q3++;
		}
		else if (x > 0 && y < 0)
		{
			Q4++;
		}
		else
		{
			AXIS++;
		}
	}
	cout << "Q1: " << Q1 << "\nQ2: " << Q2 << "\nQ3: " << Q3 << "\nQ4: " << Q4 << "\nAXIS: " << AXIS << "\n";

	return;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	vector<pair<int, int>> A;

	input_A(A);
	find_answer(A);

	return 0;
}