## Wednesday, December 2, 2015

### AvoidRoads - TopCoder

https://community.topcoder.com/stat?c=problem_statement&pm=1889&rd=4709
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.

http://www.cnblogs.com/lautsie/p/3258732.html

`    ``public` `long` `numWays(``int` `width, ``int` `height, String[] bad) {`
`        ``HashMap<String,HashSet<String>> blocks = ``new` `HashMap<String,HashSet<String>>();`
`        ``for` `(String badStr : bad) {`
`            ``String[] bl = badStr.split(``" "``);`
`            ``int` `x1 = Integer.parseInt(bl[``0``]);`
`            ``int` `y1 = Integer.parseInt(bl[``1``]);`
`            ``int` `x2 = Integer.parseInt(bl[``2``]);`
`            ``int` `y2 = Integer.parseInt(bl[``3``]);`
`            ``String p1 = ``""` `+ x1+ ``":"` `+ y1;`
`            ``String p2 = ``""` `+ x2 + ``":"` `+ y2;`
`            ``// p1 -> p2 && p2-> p1 are blocked`
`            ``if` `(!blocks.containsKey(p1)) {`
`                ``HashSet<String> set = ``new` `HashSet<String>();`
`                ``blocks.put(p1, set);`
`            ``}`
`            ``if` `(!blocks.containsKey(p2)) {`
`                ``HashSet<String> set = ``new` `HashSet<String>();`
`                ``blocks.put(p2, set);`
`            ``}`
`            ``blocks.get(p1).add(p2);`
`            ``blocks.get(p2).add(p1);`
`        ``}`
`        ``long` `mx[][] = ``new` `long``[width+``1``][height+``1``];`
`        `
`        ``for` `(``int` `i = ``0``; i < width+``1``; i++) {`
`            ``for` `(``int` `j = ``0``; j < height+``1``; j++) {`
`                ``if` `(i == ``0` `&& j == ``0``) {`
`                    ``mx[i][j] = ``1``;`
`                ``}`
`                ``else` `{`
`                    ``String s0 = ``""``+i+``":"``+j;`
`                    ``String s1 = ``""``+(i-``1``)+``":"``+j;`
`                    ``String s2 = ``""``+i+``":"``+(j-``1``);`
`                    ``if` `(i > ``0` `&& !(blocks.containsKey(s1) && blocks.get(s1).contains(s0))) {`
`                        ``mx[i][j] += mx[i-``1``][j];`
`                    ``}`
`                    ``if` `(j > ``0` `&& !(blocks.containsKey(s2) && blocks.get(s2).contains(s0))) {`
`                        ``mx[i][j] += mx[i][j-``1``];`
`                    ``}`
`                ``}`
`            ``}`
`        ``}`
`        ``return` `mx[width][height];`
`    ``}`
http://blog.csdn.net/wang1990wen/article/details/41986961
https://github.com/irpap/TopCoder/blob/master/AvoidRoads/src/AvoidRoads.java

## Labels

GeeksforGeeks (1107) LeetCode (985) Algorithm (795) Review (759) to-do (631) LeetCode - Review (506) Classic Algorithm (324) Dynamic Programming (292) Classic Interview (288) Google Interview (242) Tree (145) POJ (139) Difficult Algorithm (132) LeetCode - Phone (127) EPI (125) Different Solutions (120) Bit Algorithms (118) Lintcode (113) Smart Algorithm (109) Math (107) HackerRank (89) Binary Search (81) Binary Tree (80) Graph Algorithm (74) Greedy Algorithm (72) DFS (66) Interview Corner (61) Stack (60) List (58) Codility (54) BFS (53) ComProGuide (52) USACO (46) Trie (45) ACM-ICPC (41) Interval (41) Data Structure (40) Knapsack (40) Jobdu (39) LeetCode Hard (38) Matrix (38) String Algorithm (38) Backtracking (36) Codeforces (36) Must Known (36) Sort (35) Union-Find (34) Array (33) prismoskills (33) Segment Tree (32) Sliding Window (32) HDU (31) Google Code Jam (30) Permutation (30) Puzzles (30) Array O(N) (29) Company-Airbnb (29) Company-Zenefits (28) Palindrome (28) to-do-must (28) Priority Queue (27) Random (27) Graph (26) GeeksQuiz (25) Logic Thinking (25) Pre-Sort (25) hihocoder (25) Queue (24) Company-Facebook (23) High Frequency (23) TopCoder (23) Algorithm Game (22) Hash (22) Bisection Method (21) DFS + Review (21) Brain Teaser (20) CareerCup (20) Merge Sort (20) Follow Up (19) O(N) (19) Time Complexity (19) Two Pointers (19) UVA (19) Ordered Stack (18) Probabilities (18) Company-Uber (17) Game Theory (17) Topological Sort (17) Codercareer (16) Heap (16) Shortest Path (16) String Search (16) Tree Traversal (16) itint5 (16) Difficult (15) Iterator (15) BST (14) Number (14) Number Theory (14) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Euclidean GCD (13) KMP (13) Majority (13) mitbbs (13) Combination (12) Modify Tree (12) Reconstruct Tree (12) Reverse Thinking (12) 尺取法 (12) AOJ (11) DFS+Backtracking (11) Graph DFS (11) LCA (11) LeetCode - DFS (11) Miscs (11) Princeton (11) Proof (11) Tree DP (11) X Sum (11) 挑战程序设计竞赛 (11) Bisection (10) Bucket Sort (10) Coin Change (10) DFS+Cache (10) HackerRank Easy (10) O(1) Space (10) Rolling Hash (10) SPOJ (10) Theory (10) Tutorialhorizon (10) Mathblog (9) Max-Min Flow (9) Prefix Sum (9) Quick Sort (9) Simulation (9) Stock (9) TreeMap (9) Use XOR (9) Book Notes (8) Bottom-Up (8) DFS+BFS (8) Linked List (8) Prime (8) Suffix Tree (8) Tech-Queries (8) 穷竭搜索 (8) Expression (7) Game Nim (7) Graph BFS (7) Hackerearth (7) Inversion (7) Quick Select (7) Radix Sort (7) n00tc0d3r (7) 蓝桥杯 (7) DFS+DP (6) DP - Tree (6) Dijkstra (6) Dutch Flag (6) How To (6) Manacher (6) One Pass (6) Pruning (6) Rabin-Karp (6) Sampling (6) Schedule (6) Stream (6) Suffix Array (6) Threaded (6) TreeSet (6) Xpost (6) reddit (6) AI (5) Big Data (5) Brute Force (5) Code Kata (5) Coding (5) Convex Hull (5) Crazyforcode (5) Cycle (5) Graph Cycle (5) Immutability (5) Java (5) Maze (5) Pre-Sum (5) Quadtrees (5) Quora (5) Subarray Sum (5) Sudoku (5) Sweep Line (5) Word Search (5) jiuzhang (5) 单调栈 (5) 树形DP (5) 1point3acres (4) Abbreviation (4) Anagram (4) Anagrams (4) Chess Game (4) Distributed (4) Find Rule (4) Flood fill (4) Histogram (4) MST (4) MinMax (4) N Queens (4) Probability (4) Programcreek (4) Subset Sum (4) Subsets (4) Symbol Table (4) Triangle (4) Water Jug (4) algnotes (4) fgdsb (4) to-do-2 (4) 最大化最小值 (4) A Star (3) B Tree (3) Coins (3) Dedup (3) Dequeue (3) Dropbox (3) Easy (3) Github (3) GoLang (3) Joseph (3) Jump Game (3) K (3) LogN (3) Minesweeper (3) NP Hard (3) O(N) Hard (3) Rectangle (3) Scala (3) SegmentFault (3) Shuffle (3) Subtree (3) Trie + DFS (3) Word Ladder (3) bookkeeping (3) codebytes (3) Array Merge (2) BOJ (2) Bellman Ford (2) Bit Counting (2) Bit Mask (2) Bloom Filter (2) Clock (2) Codesays (2) DP - DFS (2) DP-3D Table (2) DP-Classical (2) DP-i-k-j (2) DP-树形 (2) Factor (2) GoHired (2) Graham Scan (2) Huffman Tree (2) Invariant (2) Islands (2) Lucene-Solr (2) Matrix Power (2) Median (2) Parentheses (2) Parser (2) Peak (2) Programming (2) Robot (2) Rosettacode (2) Search (2) SimHash (2) Skyline (2) Summary (2) TV (2) Tile (2) Tree Sum (2) Word Break (2) Word Graph (2) Word Trie (2) 剑指Offer (2) 数位DP (2) 1-X (1) 51Nod (1) Akka (1) BACK (1) BK-Tree (1) BZOJ (1) Basic (1) Bayes (1) Big Integer (1) Big Number (1) Binary (1) Bipartite (1) BitMap (1) BitMap index (1) BitSet (1) BuildIt (1) C/C++ (1) CC Interview (1) Cache (1) Chinese (1) Cloest (1) Clone (1) Code Quality (1) Company-Epic (1) Company-Yelp (1) Concurrency (1) Custom Sort (1) DFS-Matrix (1) DP-Difficult (1) DP-Graph (1) DP-MaxMin (1) Database (1) Diagonal (1) Domino (1) Dr Dobb's (1) Duplicate (1) FST (1) Fraction (1) Funny (1) Game (1) Generation (1) GeoHash (1) Google APAC (1) Gray Code (1) HOJ (1) Hanoi (1) How Hash (1) How to Test (1) Improve It (1) In Place (1) Interview (1) Isomorphic (1) JDK8 (1) Knight (1) Kruskal (1) Kth Element (1) Linkedin (1) Local MinMax (1) Matrix BFS (1) Matrix Graph (1) Matrix+DP (1) MinHash (1) MinMax Heap (1) Monto Carlo (1) Multiple DFS (1) Next Element (1) PAT (1) Parenthesis (1) Partition (1) Path Finding (1) Persistent (1) Power Set (1) PreProcess (1) Python (1) RSA (1) Ranking (1) Rddles (1) ReHash (1) Realtime (1) Region (1) Resources (1) Robin (1) Selection (1) Similarity (1) Square (1) String DP (1) SubMatrix (1) Subsequence (1) TSP (1) Test (1) Test Cases (1) Thread (1) TimSort (1) Top-Down (1) Tournament (1) Tree Rotate (1) Trie vs Hash (1) Triplet (1) Two Stacks (1) UyHiP (1) Valid Tree (1) Vector (1) Wiggle Sort (1) Wikipedia (1) ZOJ (1) ZigZag (1) codevs (1) cos126 (1) javabeat (1) jum (1) sqrt(N) (1) 两次dijkstra (1) 九度 (1) 二进制枚举 (1) 夹逼法 (1) 归一化 (1) 折半枚举 (1) 枚举 (1) 状态压缩DP (1) 男人八题 (1) 英雄会 (1) 逆向思维 (1)