329B.md (5829B)
1 Source: https://codeforces.com/problemset/problem/329/B 2 3 B. Biridian Forest 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 You're a mikemon breeder currently in the middle of your journey to become a mikemon master. Your current obstacle is go through the infamous Biridian Forest. 22 23 The forest 24 25 The Biridian Forest is a two-dimensional grid consisting of *r* rows and *c* columns. Each cell in Biridian Forest may contain a tree, or may be vacant. A vacant cell may be occupied by zero or more mikemon breeders (there may also be breeders other than you in the forest). Mikemon breeders (including you) cannot enter cells with trees. One of the cells is designated as the exit cell. 26 27 The initial grid, including your initial position, the exit cell, and the initial positions of all other breeders, will be given to you. Here's an example of such grid (from the first example): 28 29  30 31 Moves 32 33 Breeders (including you) may move in the forest. In a single move, breeders may perform one of the following actions: 34 35 * Do nothing. 36 * Move from the current cell to one of the four adjacent cells (two cells are adjacent if they share a side). Note that breeders cannot enter cells with trees. 37 * If you are located on the exit cell, you may leave the forest. Only you can perform this move — all other mikemon breeders will never leave the forest by using this type of movement. 38 39 After each time you make a single move, each of the other breeders simultaneously make a single move (the choice of which move to make may be different for each of the breeders). 40 41 Mikemon battle 42 43 If you and *t* (*t* > 0) mikemon breeders are located on the same cell, exactly *t* mikemon battles will ensue that time (since you will be battling each of those *t* breeders once). After the battle, all of those *t* breeders will leave the forest to heal their respective mikemons. 44 45 Note that the moment you leave the forest, no more mikemon battles can ensue, even if another mikemon breeder move to the exit cell immediately after that. Also note that a battle only happens between you and another breeders — there will be no battle between two other breeders (there may be multiple breeders coexisting in a single cell). 46 47 Your goal 48 49 You would like to leave the forest. In order to do so, you have to make a sequence of moves, ending with a move of the final type. Before you make any move, however, you post this sequence on your personal virtual idol Blog. Then, you will follow this sequence of moves faithfully. 50 51 Goal of other breeders 52 53 Because you post the sequence in your Blog, the other breeders will all know your exact sequence of moves even before you make your first move. All of them will move in such way that will guarantee a mikemon battle with you, if possible. The breeders that couldn't battle you will do nothing. 54 55 Your task 56 57 Print the minimum number of mikemon battles that you must participate in, assuming that you pick the sequence of moves that minimize this number. Note that you are not required to minimize the number of moves you make. 58 59 Input 60 61 The first line consists of two integers: *r* and *c* (1 ≤ *r*, *c* ≤ 1000), denoting the number of rows and the number of columns in Biridian Forest. The next *r* rows will each depict a row of the map, where each character represents the content of a single cell: 62 63 * 'T': A cell occupied by a tree. 64 * 'S': An empty cell, and your starting position. There will be exactly one occurence of this in the map. 65 * 'E': An empty cell, and where the exit is located. There will be exactly one occurence of this in the map. 66 * A digit (0-9): A cell represented by a digit X means that the cell is empty and is occupied by X breeders (in particular, if X is zero, it means that the cell is not occupied by any breeder). 67 68 It is guaranteed that it will be possible for you to go from your starting position to the exit cell through a sequence of moves. 69 70 Output 71 72 A single line denoted the minimum possible number of mikemon battles that you have to participate in if you pick a strategy that minimize this number. 73 74 Examples 75 76 Input 77 78 ``` 79 5 7 80 000E0T3 81 T0TT0T0 82 010T0T0 83 2T0T0T0 84 0T0S000 85 ``` 86 87 Output 88 89 ``` 90 3 91 ``` 92 93 Input 94 95 ``` 96 1 4 97 SE23 98 ``` 99 100 Output 101 102 ``` 103 2 104 ``` 105 106 Note 107 108 The following picture illustrates the first example. The blue line denotes a possible sequence of moves that you should post in your blog: 109 110  111 112 The three breeders on the left side of the map will be able to battle you — the lone breeder can simply stay in his place until you come while the other two breeders can move to where the lone breeder is and stay there until you come. The three breeders on the right does not have a way to battle you, so they will stay in their place. 113 114 For the second example, you should post this sequence in your Blog: 115 116  117 118 Here's what happens. First, you move one cell to the right. 119 120  121 122 Then, the two breeders directly to the right of the exit will simultaneously move to the left. The other three breeder cannot battle you so they will do nothing. 123 124  125 126 You end up in the same cell with 2 breeders, so 2 mikemon battles are conducted. After those battles, all of your opponents leave the forest. 127 128  129 130 Finally, you make another move by leaving the forest. 131 132 