[DP] AvoidRoads - TopCoder

Problem Statement

In the city, roads are arranged in a grid pattern. Each point on the grid represents a corner where two blocks meet. The points are connected by line segments which represent the various street blocks. Using the cartesian coordinate system, we can assign a pair of integers to each corner as shown below.

You are standing at the corner with coordinates 0,0. Your destination is at corner width,height. You will return the number of distinct paths that lead to your destination. Each path must use exactly width+height blocks. In addition, the city has declared certain street blocks untraversable. These blocks may not be a part of any path. You will be given a String[] bad describing which blocks are bad. If (quotes for clarity) “a b c d” is an element of bad, it means the block from corner a,b to corner c,d is untraversable. For example, let’s say
width = 6
length = 6
bad = {“0 0 0 1”,”6 6 5 6”}
The picture below shows the grid, with untraversable blocks darkened in black. A sample path has been highlighted in red.

Definition

Class: AvoidRoads
Method: numWays
Parameters: int, int, String[]
Returns: long
Method signature: long numWays(int width, int height, String[] bad)
(be sure your method is public)

Constraints
- width will be between 1 and 100 inclusive.
- height will be between 1 and 100 inclusive.
- bad will contain between 0 and 50 elements inclusive.
- Each element of bad will contain between 7 and 14 characters inclusive.
- Each element of the bad will be in the format “a b c d” where,
a,b,c,d are integers with no extra leading zeros,
a and c are between 0 and width inclusive,
b and d are between 0 and height inclusive,
and a,b is one block away from c,d.
- The return value will be between 0 and 2^63-1 inclusive.

Examples
0)

6
6
{“0 0 0 1”,”6 6 5 6”}
Returns: 252
Example from above.
1)

1
1
{}
Returns: 2
Four blocks aranged in a square. Only 2 paths allowed.
2)

35
31
{}
Returns: 6406484391866534976
Big number.
3)

2
2
{“0 0 1 0”, “1 2 2 2”, “1 1 2 1”}
Returns: 0

import java.util.*;

public class AvoidRoads{
public static long numWays(int width, int height, String[] bad){
long[][] map = new long[width+2][height+2]; //map refer to the corners.
String[][] block = new String[bad.length][4]; //block refer to the blocked roads.

Ref:https://community.topcoder.com/stat?c=problem_statement&pm=1889&rd=4709

My code:

import java.util.*;

public class AvoidRoads{
    public static long numWays(int width, int height, String[] bad){
        long[][] map = new long[width+2][height+2];     //map refer to the corners.
        String[][] block = new String[bad.length][4];   //block refer to the blocked roads.

        //change the block string so that we can set the second postion further in the map.
        for(int k = 0;k<bad.length;k++){
            block[k] = bad[k].split(" ");
            if(Integer.parseInt(block[k][0])>Integer.parseInt(block[k][2])){
                String temp="";
                temp = block[k][0];
                block[k][0] = block[k][2];
                block[k][2] = temp;
            }
            if(Integer.parseInt(block[k][1])>Integer.parseInt(block[k][3])){
                String temp="";
                temp = block[k][1];
                block[k][1] = block[k][3];
                block[k][3] = temp;
            }
        }
        for(int row=0;row<height+2;row++){
            for(int col=0;col<width+2;col++){
                if(row ==0||col ==0)            //I add two lines off the map system to show there is no way on the edge.
                    map[row][col] = 0;
                else{
                    map[row][col] = map[row-1][col]+map[row][col-1];    //Here is the key point.First we calculate the possible solution without thinking the blocked ones.
                    for(int k = 0;k<bad.length;k++){
                    if(col==(Integer.parseInt(block[k][2])+1)&&row==(Integer.parseInt(block[k][3])+1)){     //if the corner is blocked,we have to distract it.
                        map[row][col] -= map[Integer.parseInt(block[k][1])+1][Integer.parseInt(block[k][0])+1];
                    }
                    }
                map[1][1] = 1;      //Be sure map[1][1] is 1.
                }

            }
        }
        for(int i=width+1;i>-1;i--){
            System.out.println(Arrays.toString(map[i]));
        }
        return map[width+1][height+1];

}
    public static void main(String[] args){
        String[] bad = {};
        System.out.println(numWays(1,1,bad));
    }
}

Another possible solution:
For a M*N map, all the possilbe ways is C (M)(M+N).
For some blocked ways, we first consider the ways we take on these blocked ways, one by one. Then we subtract it from the C (M)(M+N).But we have to be careful because there are some ways we subtract twice so we have to add them back. Finally we can also get the correct answer.