Hiring Test codechef solution in c++

 

Hiring Test Problem Code: HIRETEST

Submit

A company conducted a coding test to hire candidates. N$N$ candidates appeared for the test, and each of them faced M$M$ problems. Each problem was either unsolved by a candidate (denoted by 'U'), solved partially (denoted by 'P'), or solved completely (denoted by 'F').

To pass the test, each candidate needs to either solve X$X$ or more problems completely, or solve (X−1)$(X-1)$ problems completely, and Y$Y$ or more problems partially.

Given the above specifications as input, print a line containing N$N$ integers. The ith$i^{th}$ integer should be 1$1$ if the ith$i^{th}$ candidate has passed the test, else it should be 0$0$.

Input:

• The first line of the input contains an integer T$T$, denoting the number of test cases.
• The first line of each test case contains two space-separated integers, N$N$ and M$M$, denoting the number of candidates who appeared for the test, and the number of problems in the test, respectively.
• The second line of each test case contains two space-separated integers, X$X$ and Y$Y$, as described above, respectively.
• The next N$N$ lines contain M$M$ characters each. The jth$j^{th}$ character of the ith$i^{th}$ line denotes the result of the ith$i^{th}$ candidate in the jth$j^{th}$ problem. 'F' denotes that the problem was solved completely, 'P' denotes partial solve, and 'U' denotes that the problem was not solved by the candidate.

Output:

For each test case, print a single line containing N$N$ integers. The ith$i^{th}$ integer denotes the result of the ith$i^{th}$ candidate. 1$1$ denotes that the candidate passed the test, while 0$0$ denotes that he/she failed the test.

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤N≤100$1\le N\le 100$
• 2≤M≤100$2\le M\le 100$
• 1≤X,Y≤M$1\le X,Y\le M$
• 1≤(X−1)+Y≤M$1\le (X-1)+Y\le M$

Sample Input 1 

3
4 5
3 2
FUFFP
PFPFU
UPFFU
PPPFP
3 4
1 3
PUPP
UUUU
UFUU
1 3
2 2
PPP

Sample Output 1 

1100
101
0

Explanation

• Sample Test 1: There are 4$4$ candidates and 5$5$ problems. Each candidate needs to solve 3$3$ or more problems completely, or 2$2$ problems completely and 2$2$ or more problems partially. Only the first and the second candidates satisfy this.

• Sample Test 2: The candidates need to either solve at least one problem completely, or they need to solve three or more problems partially. Only candidates 1$1$ and 3$3$ satisfy this.

• Sample Test 3: The candidate needs to either solve two or more problems completely, or solve at least one problems completely and two problems partially. The candidate does not satisfy this.

solution:

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

void solve() {
	string s;
	ll n, m;
	cin >> n >> m;
	ll x, y;
	cin >> x >> y;
	for (int i = 0; i < n; i++)
	{
		vector<char> v(m);
		for (int i = 0; i < m; i++)
		{
			cin >> v[i];
		}
		ll countF = 0, countP = 0;
		for (int i = 0; i < m; i++)
		{
			if (v[i] == 'P')
				countP++;
			if (v[i] == 'F')
				countF++;
		}

		if (countF >= x)
			s += "1";
		else if (countF == x - 1 && countP >= y)
			s += "1";
		else
			s += "0";
	}
	cout << s << "\n";
}

int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		solve();
	}

	return 0;
}