A Subtask Problem codechef solution in cpp

 

A Subtask Problem Problem Code: SUBTASK

Submit

Chef recently solved his first problem on CodeChef. The problem he solved has N$N$ test cases. He gets a score for his submission according to the following rules:

1) If Chef’s code passes all the N$N$ test cases, he gets 100$100$ points.

2) If Chef’s code does not pass all the test cases, but passes all the first M(M<N)$M(M<N)$ test cases, he gets K(K<100)$K(K<100)$ points.

3) If the conditions 1$1$ and 2$2$ are not satisfied, Chef does not get any points (i.e his score remains at 0$0$ points).

You are given a binary array A1,A2,…,AN$A_1,A_2,\dots ,A_N$ of length N$N$, where Ai=1$A_i=1$ denotes Chef's code passed the ith$i^{th}$ test case, Ai=0$A_i=0$ denotes otherwise. You are also given the two integers M,K$M,K$. Can you find how many points does Chef get?

Input Format

• First line will contain T$T$, number of testcases. Then the testcases follow.
• The first line of each test case contains three space-separated integers N,M,K$N,M,K$.
• The second line contains N$N$ space-separated integer A1,A2,…,AN$A_1,A_2,\dots ,A_N$.

Output Format

For each testcase, output in a single line the score of Chef.

Constraints

• 1≤T≤100$1\le T\le 100$
• 2≤N≤100$2\le N\le 100$
• 1≤M<N$1\le M<N$
• 1≤K<100$1\le K<100$
• 0≤Ai≤1$0\le A_i\le 1$

Sample Input 1 

4
4 2 50
1 0 1 1
3 2 50
1 1 0
4 2 50
1 1 1 1
5 3 30
1 1 0 1 1

Sample Output 1 

0
50
100
0

Explanation

Test case 1$1$: Chef's code neither passes all 4$4$ test cases nor passes the first 2$2$ test cases. Hence he does not get any points.

Test case 2$2$: Chef's code does not pass all 3$3$ test cases, but passes the first 2$2$ test cases. Hence he gets 50$50$ points.

Test case 3$3$: Chef's code passes all the 4$4$ test cases. Hence he gets 100$100$ points.

solution

#include<iostream>
#include<vector>
using namespace std;

int main()
{

   int t;
   cin >> t;
   for (int j = 0; j < t; j++)
   {
	   int n, m, k;
	   cin >> n >> m >> k;
	   vector<int> v(n);
	   //fill vector
	   for (int i = 0; i < n; i++)   cin >> v[i];
	   //check n
	   int cn = 0;
	   for (int i = 0; i < n; i++)
	   {
		   if (v[i] == 1)
			   cn++;
	   }
	   //check m
	   int cm = 0;
	   for (int i = 0; i < m; i++)
	   {
		   if (v[i] == 1)
			   cm++;
	   }
	   //put score
	   int score;
	   if (cn == v.size())
		   score = 100;
	   else if (cm == m)
		   score = k;
	   else
		   score = 0;
	   //print score
	   cout << score << "\n";
   }

	return 0;
}