# Marathon Match 89 - Marathon Match 89

## Key Information

Register
Submit
The challenge is finished.

Timezone:Etc/UTC

Registration

Starts

Oct 12, 2015

17:00

Ends

Oct 26, 2015

17:00

Submission

Starts

Oct 12, 2015

17:00

Ends

Oct 26, 2015

17:00

Review

Starts

Oct 26, 2015

17:00

Ends

Oct 26, 2015

17:00

Winners Announced

Oct 26, 2015

17:00

## Challenge Overview

### Problem Statement

You are given a maze. You enter the maze from outside in any cell, and start to explore it. Each cell of the maze contains a relative operator which describes the direction in which you may leave the cell once you've entered it. There are 5 types of cells:
• 'R' - turn 90 degrees right;
• 'L' - turn 90 degrees left;
• 'U' - turn 180 degrees (leave from the side of the cell from which you've entered);
• 'S' - move forward;
• 'E' - move everywhere (all leave directions are allowed).
So, you are given a maze, but you want to improve it and make it more interesting to explore. This is, you want to make as many maze cells reachable via paths as possible. A path is a sequence of moves between cells which you can use to enter the maze from any border cell and to exit it from another (or the same) border cell. A path can visit any cell only once, but different paths can visit same cell. Blue lines show valid paths on the image.

To modify the maze, you can use a limited number of maze fix operations. One fix changes the type of any one cell within the maze to any other type, except for 'E'. You may not fix a cell that contains 'E'.

### Implementation Details

Your code should implement one method improve(String[]maze, int F). maze describes the maze itself: each character in maze will be 'R','L','U','S','E' for cells of the maze or '.' for a cell outside of the maze. F is the number of fixes you are allowed to use. Your return from this method should be a String[], containing at most F elements. Each element of your return should be formatted as "R C T", where R and C are row and column coordinates of the cell you want to fix, and T is the new type of this cell.

### Scoring

Your score for a test case will be calculated as the number of cells visited by at least one path, divided by the total number of cells in the maze ('.' cells are not counted). If your return contains an invalid fix or too many fixes, your score for this test case will be 0. Your overall score will be a sum of your scores for individual test cases.

### Tools

An offline tester/visualizer is available here. You can use it to test/debug your solution locally. You can also check its source code for exact implementation of test case generation and score calculation.

### Definition

 Class: MazeFixing Method: improve Parameters: String[], int Returns: String[] Method signature: String[] improve(String[] maze, int F) (be sure your method is public)

### Notes

-Each cell you change must be contained within the maze (you can't change '.' cells into maze cells). Both old and new type of cell must be one of: 'R','L','U' or 'S'.
-Borders of maze (first and last row and column) will contain only '.' cells.
-The width and height of the maze are chosen between 10 and 80, inclusive.
-The number of allowed fixes F will be between N/10 and N/3, where N is the number of non-'.' cells in the maze.
-The time limit is 10 seconds and the memory limit is 1024MB.
-There is 10 examples cases and 100 provisional cases.

### Examples

0)

 `"1"`
```Returns:
"seed = 1
W = 10, H = 10, cells in maze N = 60
Cells to fix F = 14
..........
..SULLER..
.LSSLLELR.
.RRESLRLS.
.RURLSSSS.
.SURUSRSR.
.UUSUSRLU.
.LELRLSSS.
..URLRUR..
..........
"```
1)

 `"2"`
```Returns:
"seed = 2
W = 20, H = 20, cells in maze N = 260
Cells to fix F = 59
....................
........RSUU........
......SSSSURRR......
....RLSSURLLLRRS....
..LUREEUSUUUSLLRER..
.RSLUSSSRRSUSRUSLSS.
.ULLUSSRRLRSUUSRURR.
.LUSRLUSLLLRSULUUUS.
.RSLSSULLRSUSUUSSSL.
.SRUSLLSESLSUULUSUU.
.ELRUULSRLRSRSRUUSU.
.USESSRLLURSULLRLUR.
.ULULSLURLLSLSLSSRL.
.LUURLRRLSUSRLULSRR.
..LRSLSUSRSLLRURUR..
....RUURUUERURRS....
......SLLESUUU......
........SUSS........
....................
"```
2)

 `"3"`
```Returns:
"seed = 3
W = 30, H = 30, cells in maze N = 684
Cells to fix F = 117
..............................
..........RUURLSLSES..........
........SRLSLULLRSRURL........
......RURULLURUURRSURUSL......
.LSLULLSRSRSLLRLSSULRURRULSRU.
.ULUSRUSRLULUULRRRUSRULLSULSS.
.SLSSSUURSRLRSUURSRSRSLSUURLU.
.RUSRSRLRLUUSUSUSURUUSRUUUESS.
.SRRRURLLLSURLLSLLRSLSSSSSURL.
.UUSULSURURULULELSULLRRRSUURU.
.RUELUSSLSUESUSURULUSUUSURRUS.
.RLUSRLLSRURRLRUSUURLSSLULSLR.
.ERLRRRLSLSSULUSSLSLLRURLSSUS.
.LUULLLSRRSLRLRLRUSLUSUSURUSR.
.URSLLRSLULRLLRRRLRLULSSRSURS.
..RLULELUUURERULRSULULLUSLRL..
......UUSLRLRSUUULLLUULU......
........LLSULUUSLSSRLS........
..........RSRSRLLLSR..........
..............................
"```
3)

 `"4"`
```Returns:
"seed = 4
W = 53, H = 78, cells in maze N = 3584
Cells to fix F = 785
.....................................................
.....................LRUUURURULS.....................
...................LRRURLLLUSSRSLS...................
.............LULULSLLSUSRLLURRLSRULRSRRR.............
...........ESLSSSLSSSLSSLRSRURSRRRSUSLSRLR...........
.......UUULRRLLRRLUUSRLUSRURSLLRRRERLLLLUUUSSU.......
...USURUURSLULLURLUUSRSURLLRLSSLSULSLSUUUUSRUUUSUU...
.LLRRRRSRSULSSUSSLRSRRSLLUSLSERRSUURRSRUULLUSUSSURUU.
.LRSUSLULRLUULSRUSSLLUURLLRRSRSRSLSULUULSSUSUURLSLUS.
.SRUEUSRLRURLLLSSURRLLUSLLLLLSRUSURULULLSRSUURRSLRUR.
.USSUSRSLLUSLSULRLRUELURLRUEUSLSUSRSUSULSRUUSRUSRRRS.
.USSLLUSULRRRUSRELRSLULRLRLSUSLRSRRLRRLSRULULLUURURU.
.RSLUURSRRUURLULRRSURLRUSULSRUSLLSSRULRLUSREURULRRLS.
.LUULLRELSLULLSSLUUSSSLURRRSULLSLLSLURLSLUSRUURSRRSL.
.RSUUUUSRLSRLRLLRUSUSSURLRULUSRLSLUSURUSURRSRLLULUSU.
.USSUUUSSRRRRSUUURSURLLSLLRURSURRLSRLSERRULSUSSRLRLR.
.SRLRRUSRLREUURRRLRLSUULSSURLEEUSSLURLRLRURSURRSLLSS.
.USUULULRRUUERUELLURRUSSSURLURSULLSLRURUELLSLLLRESER.
.RRULLSURRURRLULRRESURURRSUSLUULULLLURSULRURSRUREURS.
.SRSRLRUSULULSRLRLUSSSUSLRLSRRURRULRRULRRSLLLSLRURLR.
.URRSLRESLRSRRURRLUSRULLRLLULLSRESSUUULSRUURUSSSUSLU.
.LLULRULSRULLSSLURLSSULULUSRLLRRLLLSLLSUSULRSLRLLLLU.
.LLUURLSUUULRRRULRLULERRLLULLLLRLLLUULSURUERLRRRLLRU.
.LSLULESLLSSLRRLUSRRUUUSSRUURUUSLSSRSULUSUSLSLSERSRR.
.SLRUUUSLURUSUSSUSSLURRERRLULUUUURUESLSSRLRSUUUUSRUL.
.SRRLEUUUUSLRSRSURSULURSULRLRLSLRLLLULRUULSSULUUSRRU.
.RUUEULRLSLSRRURULRRLLURUUULSSRLLSSELREEUURRSUUSRURR.
.SULLSUUUUSLLSLSURERRUSSSRUSSLSRSRLLRRSRSURSUURRUSUS.
.URSUULLLUSLUELLRSLUUSURUSLLSUUUULLUUULLRUULUSULULLE.
.LRLUSURSUSLULUULUUULEUSSSUULRRRLLULURSLRRLLSSURRSRU.
.ULLUESULLSRSLULRSULURERUSRURSRULSUSLRRRLULLURLSLLSL.
.LRLLRSLUSLRRSESRRURUELSSREUUURLLUSUSSURLRLRLLSLSURU.
.LRRRSRRRSRRUUSELLLLLLSLEUUSRSRLLSURURSESSULELURLLUR.
.RSUSSSUSSULRSERRUSURLSUSUUULLSURSUSULLRRLSELSLRUUUS.
..URSULSRUURLSUSLRUURLSRSLUSRLURSLRRLSUSSRELSSRSLSU..
.......UUULRLSSRLLRRULULSLSLLLESUSLRLULLUULSSL.......
.............RLSSSSSRERRSESSRERRULRLUUUL.............
...................ELLLSRSLLRUSLSU...................
.....................................................
"```
4)

 `"5"`
```Returns:
"seed = 5
W = 66, H = 58, cells in maze N = 2916
Cells to fix F = 915
..................................................................
............................RLSULRLULS............................
........................SLURRRRURLSURLLSUU........................
.......................SLLLSUSRLLRRRSULRSUL.......................
..................RLSLSUUURULLRSULRSESRLRRRUURSR..................
................RRERULURLLSSSULRLURSRUUEUURSUSLSSL................
.............RSRLSSSERLSRLULSLSUUEUUUUUSLSLSRLLLSLUUS.............
...........SRRLLLRRSULURRRLLLUUSLLLRLSURLSRRSLUURULLRLU...........
........SLLUUURRRLUUSSSSLRLLSURUSLULSSSSRUSURSLEUSLSURSRRS........
.RSRSRSLLSSSRULSLLRERERUSUSLUSLUSURRSLLLLRRRUUSSLLUSURRULUUUSSLUL.
.LEUERLLSLLSSRLLURSULUUSULLRLRUSRRSLSEULRUSLLURSLRRULRESLUUSLLSSR.
.LRRSLUSSUSSUSSLSLRSRRSEULLSULSUSEUUURSLSSUSLSUULUUUUESUURUEUEURS.
.RSRRLLSLLLLULRRRUSSULRSULSRUURRRLSSELLLRSLRSLLUSLLULUULRUSLSSSSS.
.ULUSERLSURLSEURSRSRUSURSULLURLSLLULLRSURRUSLRUSRRLRRUULLSURSLSUL.
.URSULRUURURLELLSRUUULSRLRRSULRLLEULURULSLULSULLLLSUURUURUULUSRUR.
.RRSUUSRSLLRLEULESLSRRSUSUELSRRUUSLLSURRURSUSEUURULRSLSRULLRLLLUS.
.URSRREUSSSRULSLLRSRLRLLSLSULUSLSURSRRRLSLLULLRSLESRLSLLRLRLRUERR.
.UULRSLRSUSSSLLRRRSRULLLRRLULUUSUUSLURRSLSUSSRSURSLRUSRSLERSRLURU.
.EUSSLSSSLLRURRLSLURLSSURRSUUURUSUSULLSRRUSLLSRULRURLSRRLRRRSRLES.
.RESLRRUSULSSLLLURRRULSSULLRLLUUSSSSSSUUSLLUSLUERSULURUURRRUSRLRS.
.LSLRULSUSRRURRLUURSRUSRURLULRRURLLLLSEURLLRLSURSUULURLSLLRUSUUUS.
....EULSRULSUULURRLURURUUURRRRLLUUULRRSUULSRSLLRSLRELLURLRSULR....
........UUURLULUUUULSSSSSERLURRRSUULRULULSURLLULSRSUSRLUUL........
.......................LUSURLRLUSSUSULLRLUU.......................
........................RLULUSLSLULRRULSRR........................
..........................UUUSSSRLLLSSLS..........................
............................LSURLRSLUS............................
..................................................................
"```
5)

 `"6"`
```Returns:
"seed = 6
W = 43, H = 42, cells in maze N = 1448
Cells to fix F = 265
...........................................
..............SRLLSLRURLLUURL..............
.........ULSEULUURSRSUUSSLURESRRSR.........
.....RSUURLLRLSRUULSLSUSSRLULSSLUSLESU.....
..RLLRLUSSRSUSRUSUSSLRRRURLLUSSLRULSRRURR..
.RUESSRUUUULULLSLSLRSUSLUSSRSLSSLRLLLRUULU.
.RSUERRRSLRRRRRLSRUSUUSSLRLRSUSUUUEURUULRL.
.ULLLLLLSUULUUELLRSRERRRURRRLSLURRRRSULSLL.
.RRUSSLLLLUURRRLEULSRRUURLULUSULUSLSUULLSL.
.RLLSULSSSLUSSRUSLRLRSURUSLLUSLSRUERUULLRU.
.LUESRURSLESULRUURSRSULSLSLLRLSSESLESLRRER.
.SLSUSSRSLUSRRESSRSELREUERRUSLSURRRLSSLSER.
.LULLUSUSRUESRUSULSUSLUUUSSUULULSURSURRRRS.
.RLSUSSSLUURLLLLURULURSLSSSURSLSUSLSLSLERL.
.SULUUSSLUSLLUUSSRLLURURURLLLURSULSSLUSRLU.
.SURLSUSRLRLSRERSLULULRLLLULUSLSLLLLRRURRS.
.SLLUSLELRRSRSRRULLLRRSUSRULSRLSLLLULUSULU.
.UULRLSLRLSSUSLLRUULLRLLLRLRRRUULLUURSUSUR.
.SRULSSLUSRLLRURLERURRUSLLSSLUURLRRLRRUSSS.
.URURRRRUURSRSRSULRUSUURURRLLRSLRSUUESLLUU.
..ULRRLUUSSSSRESLLLRSLSRURUSLSSSLSESSRRUE..
...LUUSUUSRURURSERUSUUULLUSRUSRRUELLUSRU...
......LLSSLLSRUSRLERLEURRLRUSUSSLRLSL......
..............URLLLSSULSUULUU..............
................LLLUULUSLSS................
...........................................
"```
6)

 `"7"`
```Returns:
"seed = 7
W = 44, H = 31, cells in maze N = 1010
Cells to fix F = 287
............................................
..................RRUUSRLU..................
..........RRRRURSRULSSULSSRRLRLRSU..........
........RRRURLSURLLSSLLRUURUELURUURS........
......LLUURSLRLEULLEELSRRRLUUSURRLSSLL......
.UURLLRRSLLSLLULUSELUULSURLULSUSRERRSUSRURE.
.SLLRRSLLUULULURSUUSUSLSRSRRRRRSLLLRLESRULL.
.SSRSRRRURLRLURSURLRLLRULSUELLUSLSSSRLRUUUE.
.RRLSSSURUSRLLSSUSRRULSSLLRURUEUSLUSURREESL.
.LSRSEELUSSLRUURRSRUSLLLLSSULRLLRSURELLRSUU.
.LUSUSRRSRSLLULSUERUSSLLSRUUSLURURURSRSUULL.
.USSLRLSRLULSURLLLERLRURULSRLUSLLRUSSSLSRUR.
.SRUSLLRLSSELUURLLRRLRRSUUULRULSUSLLLSUSLSS.
.LURSLSUSURSLRULSSLLUUSULUSERSRSRRRLLUUURLL.
.SLLSLUULULRLRUSEUUULLLRSUSUSLUULSLUURRLRSU.
.SRLRLLRELUSSLURLLLRLRLRLRSULRLSURLLULSSLUS.
........ERRSUSLRSRUSLSSUSULERELRLULU........
..........USURURLSRSLLLEUSSSSSRRSU..........
..................SLSSRSLL..................
............................................
"```
7)

 `"8"`
```Returns:
"seed = 8
W = 73, H = 60, cells in maze N = 3722
Cells to fix F = 908
.........................................................................
....................LLUURRELSUSLSEUSSLSUURURLUSRRRRRL....................
.................LLSLUSLSURULLSURULLUULSSUSULRLUSRLSRLLS.................
.............RUSSURUUSUULLUSRRRLSUUEELRSLURLRLURRLSLRLUULURU.............
...........USSURUSURRRRSLLRRUSLSURRLLLLUULSRURURSRESLSUUUELSSL...........
.........RSLULRLRULSLSULSUSRLRLSSRRLLRSULUUREUURSRSULLLUURRSRESR.........
.......RURLLURLUUULUSUSRRRRLLUEULSLRSRUULELLUURLURUULUUSLRLLSSLRSR.......
..LURRLSLRLUUSLULERULRLRRRUULLSLLSLSSEUESLSSRSUSRLULLUUUSSRUURLLEULRUUU..
.SRLSUSUSRUURURSRSLRLULSSSSSLSURRLRESLLUUSRLUSRULSRUUURURSLULSUUUSURRUSR.
.ULSLLRURUULLLRLSLSURSUSRLSUURLEULLLUSRRRRLUUSULRLSEUSLLULRULLLURUULSLLS.
.LRSLLERLLRLLRRRUSRSRSERSLRSUUUSLUSURUUUSUURRRUSRRURLSSSSURRSUUULLRERLLU.
.LRURURLLRURUUULULSSULLLLUSULUUULSUSRUUSLSRSLLUULSLRLRRLRSUESLLLULRRURRU.
.SSRLRRLSRRURLULUSSSURLRURSLUUUULSUURSRRLSRUELURRLSUEERSRESRRSRLSLLLULLR.
.RRRRSLLSRLLLLUSRSLURLUULRELULUELLUSLUSSRRUSLSLELURSUUULSLUSLULSRLSRLSRR.
.SRULSRLLSLLLSLRSUUSSSLSRSRULURSLREELRRERSRULLSLUSLLLSSULRLULRSULRELLUSU.
.SLLSSLSUUERULUUSSRLRUUSSLLEURRUURLUULRRRLSLURSLLRULRLUUELRLRESSLRURSRLL.
.RLREUUUUUUUESULLURLRRLSSURSRRSRRRSLSSSSLLRSRSULURULSLLSLESUSUULSLRSLLRS.
.SRRRSUSULSSRULSRUULURUSSRSLSRLRUURUESLRULSLUURLURSRSRSRRLSRULSSSSUSSLLU.
.LRLSLUUSLLSUSSRRLULLULUSRLSRSLSSSSLRUSLLRLRRLSRUULRSRLLSLLSRRLRRRLSSLRL.
.RUULLRULLLELRRRLUUSULUESRSUSRERRRSRULLULSRRURRURRRRSRSRURSLSRSUELRLRSUR.
.SRURRLRSRSLSURULEESSRRULSUURURULSRLSULLELSSRSRLSLSULRRUSRRLRULLLUSRLSUR.
..SLELRURURRUULLLUUUSRUSSSSRRLSRSURULRUUULSRSURUURULSUUUULUULUSRLRLUURL..
....LRUUSSSSLLESRRLESLUUUSLLSRSURLLRSLSUEUELRSLUUUSSSSRRUULREULSSLLUU....
...........SRURSRUSULLRUSSSRRRSUSLUSLLELRRLRULSRLSLRLSSLLURLUR...........
....................SRRSRLESRRRUUUURLRUURREULRUSRRLUR....................
.........................SUUSRSRSRRUSRRRSRURUURL.........................
.........................................................................
"```
8)

 `"9"`
```Returns:
"seed = 9
W = 76, H = 40, cells in maze N = 2328
Cells to fix F = 323
............................................................................
...........................RLLULULURSURRLUURUUREU...........................
........................ULRRRLLRUSUSRURLRSLLSLRRULRU........................
.....................LSULLUULSRLULSRLUUEURRUULSRRLRLESL.....................
...............USSRSUELULSLRSRSRUULRLLULSUSLLSRSUSSURULRURSLR...............
...........LUUUURLRRLRSEULLLSLULUERLLERUSLSSESSUUSLUURRLLUULLRLSL...........
.........ULUSLLSRLLRRSESLULESRUSSRUSRLLRLLRLULRSRSUSLUSUESSLSLLUULR.........
......RSLUSRURUSSLUULSRLREULLRSRUSLRRLSSSLLSLUSSRLLUSRRLSSSSLLRLSRURLU......
.LURRRLLULLUSLSRULLRRSRLLSUULRLURSLURLLUSLUUSRSRLULLSSRERRURSRLLSSUULRULURU.
.LELSUULUSUURLURSLRRSRRSUUUUSUSUURERSRLSRSRLRLUURURRSESSLSLSRSLLULLSULLLRSR.
.ULRLUUSRRLLESULLUUURULULUURSURLSSRSURRLSRUSSLLUUSRUSLUSLRLLSULRLRSRRSUSSLL.
.SSLERUSRRSLELLLULUUSLRREUSRSLRUSSRRSULRURLSUERULSLRUSSUULRRSUURUSRLSRRRUSU.
.LRUUUSEUULSURSRRUURERUULUUSRSLSSLLRESLULUUURLUURSLLLRRRUULSSLRSELLSRUERLRU.
.UUUSUSRRUURUSERLSRURRSULLSLSLRRUSURRURUELRLRLRLULSUUULLUUSSURLRLLSULRRLSSS.
.........LSRUSLLRRRRRLSURSELLLSRRUULELLRUESRSUUSLRESURRSUUSELLLUSLR.........
...........LRRRLUSLLESUSULURURURSLRUURRRESULULUSLREUUUURLULUULLRL...........
...........................RELLRLLRLULUSSEULUURUL...........................
............................................................................
"```
9)

 `"10"`
```Returns:
"seed = 10
W = 80, H = 80, cells in maze N = 5484
Cells to fix F = 1804
................................................................................
....................................SLSRRSES....................................
............LRSRLRRURSLURSREUULSSRUSRERSLULULRSLLUURSRUULLSESULLURLS............
.LRLSLRLLLLULSLELELUULRSLSSRUSLLEUSRLRLLSUUERULRSLSSSSSRUURLRLRELRLSRLSRUULSELL.
.RSRUUUSLUUSSLLUSUSRRLLRSLLRUUURUUUUERLRRLRSRSRRRSLLELERRSRSUSSRRSURRSRSRSLRUUU.
.RULUUERLSLUELLRSRUSLULLSSSSRSRSLURUSLSLUUURSLSRRULSLLUURSUSURULLLSLLULLSULSURS.
.RUURSLSLLLSRULLURUULULLLSUURSULRRLSURSRLLSLSURRRULRLRUESSUERSLSRLSSLLRLLSULUUU.
.UULLRRUUSULRLULRULLUURUUSRRRRUSLSRUULULUSRRSLLRSRURRRSLSURRLRLRRUULUUSUSSULRRU.
.ULRUUSRUSUSRULLSRSULULUUUSLLUSLUERLSSUSSSURRRRRERRLSLUSLLLULLSRRSLUSRLRLSERSUS.
.SULUSLLLRSUUULLSSSSLLURRRUSUSUESUSLURSUSSURRSRRLRULLLSUSLSLUSRUUUSSSRESSSLSLUR.
.LURSLRULLLSUSLLRLUUSSSRELLSRESSRRSRSUSUUSLLUURULLUULRLSRELLSSSLELRRUREURRSUURU.
.LSUUSUULURLSSRUULSUELLSLRSRRLRLUSURSUULSEULLRLULESLLSRLULLSRSUUSLRLSRSRULUSSUL.
.UURLSSELRLSRSLRUSUSSLSURUUURLLSRLULUREULSLULRRLSULLRESLLSLSSSULSUELUUUULLSSLUS.
.URULSSURRUULSSELSLRLLULRURRLLLSLULULLRREUULSULULUULUSRLULRURURSRRRRLRRELSSLLLS.
.SRLURUSLSSSRRLLEULRSRSRRRSUUULRRSREUSLUSLLRSLLRLURSERLSSLUSRLUURLSSLUESRURULSU.
.ULSRLSLRRSLRURSLULSURRRRSUSERRRLLUESSUSLUELSUURSURRUSLLUERSRRRRRUULUUUSLSRLRLL.
.RSRLURRRURRUUSLRRRSUURUULLSRRULLSLLLRSUUSLLURRUURLSULRUULLLSERUSULLLULULLRLRSL.
.SRSRULSLLSSRURSRLUUURLSSUSLLLRLSRSRSULLLLSSUELELSSSLLUUURSRSLURLULRUSRSRSRRLSS.
.LULRRSRRSLRURLSLUURRUULURRSLSSUSRLUULUSUUUSLRLRRRRRLRLLURUUUSLRRLRRULURULLULUR.
.RURLULRESRULSRSLRRUULRLSSSLUSESSLUSLELSSRUESLUUURRSLUELLELUUSRLSLULSUSRSLSLLRU.
.SELSRLLSSRSURLUSLRRERLURESULESRUUURULRURURLRRSRUUUULEUSSSSSLRLRRURERRULRLLRRSL.
.USLRRRSLUUUERLURSUURSLUUUUSSRRLLULRUSSSLLLSSSSLLLLSLLSRSLERSURLURLULUSRULLLRRR.
.ERSUSRULSUULUSLUSRSRRRUSSSURLLRSURRRLLRRLLURUSURULSSLLRLSSLUSUUUULSURLLURUUSUR.
.UULULUSLLSSSRLRLSUUSSLSRSURLSUURRURRRRUULSSUSSSLSLEULSSSLRLSLLLRLRSLLULLLSRUUU.
.RRRRLLLSLUUSUSRUUUSSUSULRSRULULLRRURURURLSSLULSUUSUSURULUSLUURSLSSSULLLSLELUSL.
..SSRSUUUSSLLSSRSUUULLUULRLLRSRRRURSRRLSUUSRUURULRLUUSLULRULRLSSRSUSRSLLSSSSRR..
........LSSLSULLSSSSLRSULERUSRUURSUSSLSSLUSLLSRRSURRSEUSSLRELSRRRUSLURLS........
....................SSLULSLRLLULRRLLRLUSSRSUSSSLSLULRRLRSLSU....................
................................USLUSSUULRLLUELU................................
....................................RRLSRLSR....................................
................................................................................
"```

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2020, TopCoder, Inc. All rights reserved.

## LEARN:

Topcoder Challenges Explained

How To Compete in a Marathon Match

## TOOLBOX:

Topcoder Templates repository