Iron, Magnet and Wall Codechef November Long challenge 2020 solution with code explanation

 Iron, Magnet and Wall  Codechef November Long challenge 2020 solution with code explanation -

Iron, Magnet and Wall  Codechef November Long challenge 2020 solution with code explanation 

Let's read problem statement,

Chef loves to play with iron (Fe) and magnets (Ma). He took a row of N$N$ cells (numbered 1$1$ through N$N$) and placed some objects in some of these cells. You are given a string S$S$ with length N$N$ describing them; for each valid i$i$, the i$i$-th character of S$S$ is one of the following:

• 'I' if the i$i$-th cell contains a piece of iron
• 'M' if the i$i$-th cell contains a magnet
• '_' if the i$i$-th cell is empty
• ':' if the i$i$-th cell contains a conducting sheet
• 'X' if the i$i$-th cell is blocked

If there is a magnet in a cell i$i$ and iron in a cell j$j$, the attraction power between these cells is Pi,j=K+1−|j−i|−Si,j$P_{i,j}=K+1-|j-i|-S_{i,j}$, where Si,j$S_{i,j}$ is the number of cells containing sheets between cells i$i$ and j$j$. This magnet can only attract this iron if Pi,j>0$P_{i,j}>0$ and there are no blocked cells between the cells i$i$ and j$j$.

Chef wants to choose some magnets (possibly none) and to each of these magnets, assign a piece of iron which this magnet should attract. Each piece of iron may only be attracted by at most one magnet and only if the attraction power between them is positive and there are no blocked cells between them. Find the maximum number of magnets Chef can choose.

Input

• The first line of the input contains a single integer T$T$ denoting the number of test cases. The description of T$T$ test cases follows.
• The first line of each test case contains two space-separated integers N$N$ and K$K$.
• The second line contains a single string S$S$ with length N$N$.

Output

For each test case, print a single line containing one integer ― the maximum number of magnets that can attract iron.

Constraints

• 1≤T≤2,000$1\le T\le 2,000$
• 1≤N≤105$1\le N\le {10}^5$
• 0≤K≤105$0\le K\le {10}^5$
• S$S$ contains only characters 'I', 'M', '_', ':' and 'X'
• the sum of N$N$ over all test cases does not exceed 5⋅106$5\cdot {10}^6$

Subtasks

Subtask #1 (30 points): there are no sheets, i.e. S$S$ does not contain the character ':'

Subtask #2 (70 points): original constraints

Example Input

2
4 5
I::M
9 10
MIM_XII:M

Example Output

1
2

Explanation

Example case 1: The attraction power between the only magnet and the only piece of iron is 5+1−3−2=1$5+1-3-2=1$. Note that it decreases with distance and the number of sheets.

Example case 2: The magnets in cells 1$1$ and 3$3$ can attract the piece of iron in cell 2$2$, since the attraction power is 10$10$ in both cases. They cannot attract iron in cells 6$6$ or 7$7$ because there is a wall between them.

The magnet in cell 9$9$ can attract the pieces of iron in cells 7$7$ and 6$6$; the attraction power is 8$8$ and 7$7$ respectively.

link-https://www.codechef.com/NOV20B/problems/FEMA2

Solution-

Read also -https://www.technicalkeeda.in/2020/11/magical-candy-problem-solution-codechef.html

To solve this problem you need to think some logic that .

1-none of iron and magnet can be paired if any wall is situated between them.

2- A iron/magnet can pair only with one magnet/iron.

3- to maximize the final answer you need need to pair a iron with a magnet which is farthest from iron. similarly you have to for magnet.

Actually implementation part is a little bit more tricky/ tough then logic.

Code explanation-

store index of iron, magnet, and wall.

and store count of the metal sheet between 0 to the current index.

and start pairing iron with the farthest magnet and magnet with the farthest iron.

If the wall encounters a clear index of iron magnet and wall. 

And repeat the same process after the wall.

Note- This question can be done by another approach.

Follow this video for another approach.

Must Join Telegram channel for Editorial -

https://t.me/competitiveProgrammingDiscussion