Chef and Races codechef solution in c++

 

Chef and Races Problem Code: CHEFRACESSubmit (Practice)

The National Championships are starting soon. There are 4$4$ race categories, numbered from 1$1$ to 4$4$, that Chef is interested in. Chef is participating in exactly 2$2$ of these categories.

Chef has an arch-rival who is, unfortunately, the only person participating who is better than Chef, i.e, Chef can't defeat the arch-rival in any of the four race categories but can defeat anyone else. Chef's arch-rival is also participating in exactly 2$2$ of the four categories.

Chef hopes to not fall into the same categories as that of the arch-rival.

Given X,Y,A,B$X,Y,A,B$ where X,Y$X,Y$ are the races that Chef participates in, and A,B$A,B$ are the races that Chef's arch-rival participates in, find the maximum number of gold medals (first place) that Chef can win.

Input Format

• The first line of input contains an integer T$T$, denoting the number of testcases. The description of T$T$ testcases follows.
• Each testcase consists of a single line containing four space-separated integers — the values of X,Y,A$X,Y,A$, and B$B$ respectively.

Output Format

• For each testcase, print a single line containing one integer — the maximum number of gold medals that Chef can win.

Constraints

• 1≤T≤144$1\le T\le 144$
• 1≤X,Y,A,B≤4$1\le X,Y,A,B\le 4$
• X≠Y$X\ne Y$
• A≠B$A\ne B$

Subtasks

Subtask #1 (100 points): Original constraints

Sample Input 1 

3
4 3 1 2
4 2 1 2
2 1 1 2

Sample Output 1 

2
1
0

Explanation

Test case 1$1$: Chef participates in the races 4,3$4,3$, whereas Chef's rival participates in 1,2$1,2$. As Chef's only rival does not participate in any of the races that Chef takes part in, Chef can win the gold medal in both of the races, thus the answer is 2$2$.

Test case 2$2$: Chef participates in the races 4,2$4,2$, whereas Chef's rival participates in 1,2$1,2$. Chef cannot win race 2$2$ as Chef will be beaten by the arch-rival, however Chef can win the gold medal for race 4$4$. Thus the answer is 1$1$.

Test case 3$3$: Chef participates in the races 2,1$2,1$, whereas Chef's rival participates in 1,2$1,2$. Chef will be beaten by the arch-rival in both races, thus the answer is 0$0$.

solution:

#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;

void solve()
{
	vector<ll> v(4);
	for (int i = 0; i < 4; i++)
	{
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	ll n = v.size();
	if (n == 4)
		cout << n / 2 << "\n";
	else 
		cout << (n - 1) / 2 << "\n";
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}