Could you explain what each part of $$this code does in $$depth$?$ Simplify it$$as $$much as $$you can. Also, could you help me $$write another version of $$this code by $$splitting it $$into two classes one with the logic one to $$run the code that does the exact same thing and returns the same results?

Sample input:

$663$

$113311322$

$026311322645342$

$1-1413243546$

Sample output:

$..$# $...$

$.$#$.$# $..$

# $.$# $.$# $.$

$.$# $.$# $.$#

$..$# $.$# $.$

$...$# $..$

$..$# $...$

$.$# $.$# $..$

# $.$# $.$# $.$

$.$# $.$# $.$#

$..$# $.$# $.$

$...$# $..$

Sample input $2$:

$542$

$106114122522334$

$0-1711415223344454$

Sample output $2$:

# $..$# $.$

$.$# $..$#

$.$# $...$

$..$# # #

# # $.$# #

$.$# # $.$#

$.$# # # $.$

$..$# # #Crystal Crosswind

Time Limit: $5$ seconds

$$

You are part of a scientific team developing a new technique to image crystal structures at the molecular level.$$ The technique involves blowing a very fine wind over the surface of the crystal at various angles to detect boundaries $($indicated by molecules that are exposed to the wind$).$ This is repeated with different wind directions and the boundaries observed for each direction are recorded.$$ Your team has already collected the data, but $$ as is often the case with applied science $$ now the real work, analysis, must begin.

$$

For a given crystal, you will receive the directions in which wind blew over the surface, and the location of all boundaries encountered by each of these winds.$$ For a wind blowing in direction $($wx$,$ wy$),$ a boundary is defined by location $($x$,$ y$)$ such that a molecule exists at $($x$,$ y$)$ and no molecule exists at $($x $$ wx$,$ y $$ wy$).$ Note that for technical reasons wx and wy are not necessarily prime.$$

The data might not uniquely determine the structure of the crystal.$$ You must find two unique structures with the minimal and maximal number of molecules consistent with the observations.

For example, in the first sample input, nine different molecules are directly encountered by the given winds. $$There must be a molecule at location $(3,3)$ because otherwise $(4,2)$ would be a boundary for the third wind.$$ For similar reasons, there must be molecules at $(4,4)$ and $(5,5).$ There cannot be any further molecules as they would result in additional observations for some of the winds.$$

$$

Input:

The first line of input contains three integers dx$,$ dy$,$ and k$,$ where dx and dy $(1$dx$,$ dy $103)$ are the maximum dimensions of the crystal structure, and k $(110)$ is the number of times wind was blown over the crystal.

Each of the remaining k lines specifies the data for one wind.$$ These lines each start with two integers wx and wy $(-$dx $$wx dx$,$ and $-$dy $$wy $$dy$,$ but not both zero$)$ denoting the direction of the wind.$$ Then comes an integer b $(0$b $105)$ giving the number of boundaries encountered by this wind.$$ The line finishes with b distinct pairs of integers x$,$ y $(1$x $$dx and $1$y $$dy$)$ listing each observed boundary.

You may assume the input is consistent with at least one crystal and that no molecules exist outside the specified dimensions.$$

$$

Output:

Output two textual representations of the crystal structure separated by an empty line.$$ Each structure has dy rows of dx characters, with the top$-$left corner representing the location $(1,1).$ The first is the structure with the minimal number of molecules consistent with the observations, the second is the maximal one.$$ Use $$#$$ for a location where a molecule exists and $.$ for a location where no molecule exists.

$$

$```$

import jaxarutid,ArbayList;

import jaxarutilutisit;

import java,uti$\backslash .$ScandeE;

public class Main $\{$

static int X$,$ Y$,$ N;

static char$[][]$ g;

static List skM$,$ wx;

static void doit$($int x$,$ int y$)\{$

char ch$.=($x $>=1$ && x X && y $>=1$ && y Y $?$ g$[$y$][$x$]$ : $\text{'}.\text{'})$;

if $($ch $==0)$ return;

for $($int i$,=0$; i$,=1$ && xX&& y$2>=1$ && y Y&& g$[$y$2][$x$2]==0)($

g$[$y$2][$x$2]=$ ch;

doit$($x$2,$ y$2)$;

$\}$

$\}$

$\}$

public static void main$($String$[]$ angs$)\{$

Scanner scandex $=$ new Scanner$($System$.$in$)$;

while $($scaddeb$,$hasNext$())\{$

X $=$ scadretudaxtInt$()$;

Y $=$ scadnew,daxtInt$()$;

N $=$ scandex,dsxtInt$()$;

g $=$ new char $[$Y$+1][$X$+1]$;

wk $=$ new AxxaxListN$)$;

WR $=$ new Axxa$\backslash$List N$)$;

for $($int ij $=0$; i$.=1$ && xX && y$2>=1$ && y Y$)$ g$[$y$2][$x$2]=\text{'}.\text{'}$;