[hihoCoder] #1307 : 穿越禁区 解题报告 - Jonah的专栏 - 博客频道 - CSDN.NET


[hihoCoder] #1307 : 穿越禁区 解题报告 - Jonah的专栏 - 博客频道 - CSDN.NET
作为H国的精英特工,你接到了一项任务,驾驶一辆吉普穿越布满监测雷达的禁区。为了简化题目,我们可以把禁区想象为一个左下角是(0, 0)右上角是( WH )的长方形区域。区域中一共有 N 座雷达,其中第 i 座的坐标是(Xi,Yi ),监测范围是半径为 Ri 的圆形区域。所有在圆内和圆上的运载工具都会被监测到。
你的目标是从左到右穿越禁区。你可以选择线段(0, 0)-(0, H)上任意一点作为起点,线段(W, 0)-(WH)上任意一点作为终点。在禁区内你可以沿任意路线行驶,只要保持始终在禁区内并且没有被雷达监测到。
给出禁区内的雷达部署方案,你需要判断是否存在满足条件的行驶路线。

输入

输入包含多组数据。
第1行是一个整数 T,表示以下有 T 组数据 (1 ≤ T ≤ 10)。
每组数据的第1行:三个整数 WHN (0 ≤ WH ≤ 1000000, 1 ≤ N ≤ 1000)。
每组数据的第2-N+1行:每行三个整数XiYiRi (0 ≤ Xi ≤ W, 0 ≤ Yi ≤ H, 1 ≤ Ri ≤ 1000000)。

输出

对于每组数据输出"YES"或者"NO"表示是否有满足条件的行驶路线。



样例输入
2
10 4 2
5 1 1
5 3 1
10 4 2
5 1 1
6 3 1
样例输出
NO
YES

思路: 这道是并查集的题目, 有好多个雷达, 我们要把能够连在一起的雷达合并起来, 看其总共是否能够覆盖从上到下. 先给每个雷达默认父结点是本身, 然后依次遍历每个雷达, 如果A雷达和B雷达能够接触到, 即他们圆心距离小于两个半径之和, 说明他们在一个集合里面, 就把B的最深父结点设置为A的最深父结点. 这样做完之后, 再依次将每个雷达的父结点设为本身的最深父结点, 就可以知道总共有几个集合, 然后计算每个集合所覆盖的范围是多少即可.
int main() { vector<pair<int ,int> > vec; int T, W, H, N, xi, yi, ri; cin >> T; while(T--) { cin >> W >> H >> N; vector<vector<int> > radars; for(int i = 0; i < N; i++) { cin >> xi >> yi >> ri; radars.push_back(vector<int>{xi, yi, ri}); } int ans = 1; vector<int> hash(N); for(int i = 0; i < N ;i++) hash[i] = i; for(int i =0; i< N; i++) { int x1 = radars[i][0], y1 = radars[i][1], r1 = radars[i][2]; for(int j = i+1; j < N; j++) { int x2 = radars[j][0], y2 = radars[j][1], r2 = radars[j][2]; float dis = sqrt(pow(x1-x2, 2)+ pow(y1-y2, 2)); if(dis <= r1+r2) { int par1 = hash[j], par2 = hash[i]; while(hash[par1] != par1) par1 = hash[par1]; while(hash[par2] != par2) par2 = hash[par2]; hash[par1] = par2; } } } set<int> parent; for(int i =0; i< N; i++) { int par = hash[i]; while(par != hash[par]) par = hash[par]; hash[i] = par; parent.insert(par); } for(int val: parent) { int top = INT_MIN, bot = INT_MAX; for(int i = 0; i < N; i++) { if(hash[i] == val) { top = max(top, radars[i][1] + radars[i][2]); bot = min(bot, radars[i][1] - radars[i][2]); if(top >= H && bot <=0) { ans = 0; i = N; break; } } } if(ans == 0) break; } if(ans) cout << "YES" << endl; else cout << "NO" << endl; } return 0; }
http://www.voidcn.com/blog/octopusflying/article/p-6644282.html
   本题是一道考察搜索算法的题目。首先需要了解的是,多个雷达的监控区域将会有重叠的现象,多个具有重叠监控区域的雷达可以构成一片连续的监控区域,如下图所示:
    
    图中红色虚框即为多个雷达构成的连续区域,寻找连续区域的过程可以通过搜索来实现,深度和广度优先搜索均可。
    得到连续区域后,通过画图可以看出:显然,存在可以躲过所有监控区域穿过禁区的路线的充要条件是所有的连续区域在y轴方向没有完全覆盖区间[0,H]。例如,上面示意图中第二个连续区域在y轴方向上完全覆盖了区间[0,H],因此,上图的情况是无解的,即不存在可以躲过所有雷达监控穿越进去的路线。
    在搜索过程中记录连续区域y坐标的最大值和最小值来得到每个连续区域的区域上界和区域下界,如果所有的连续区域满足:区域上界不小于H,或区域下界大于0,则存在有效的路线;如果存在一个连续区域满足:区域上界不小于H,并且区域下界不大于0,则不存在有效的路线。
    以上为本题解法,解答时需要注意数据溢出。

 private static class Radar {
  int x;
  int y;
  int r;
  boolean visited;
 }

 /**
  * Input data.
  */
 @SuppressWarnings("unused")
 private static int T, W, H, N;

 /**
  * Radar list.
  */
 private static Radar[] radars;

 /**
  * For input.
  */
 private static Scanner scan;

 /**
  * Record the range.
  */
 private static int min, max;

 /**
  * The main program.
  * 
  * @param args
  *            The command-line parameters list.
  */
 public static void main(String[] args) {
  scan = new Scanner(System.in);

  T = scan.nextInt();

  for (int i = 0; i < T; i++) {
   function();
  }

  scan.close();
 }

 /**
  * Deals with one test case.
  */
 private static void function() {
  W = scan.nextInt();
  H = scan.nextInt();
  N = scan.nextInt();

  radars = new Radar[N];

  for (int i = 0; i < N; i++) {
   radars[i] = new Radar();
   radars[i].x = scan.nextInt();
   radars[i].y = scan.nextInt();
   radars[i].r = scan.nextInt();
   radars[i].visited = false;
  }

  for (int i = 0; i < N; i++) {
   if (!radars[i].visited) {
    max = Integer.MIN_VALUE;
    min = Integer.MAX_VALUE;
    dfs(i);
    if(min <= 0 && max >= H) {
     System.out.println("NO");
     return;
    }
   }
  }
  
  System.out.println("YES");
 }

 /**
  * Use DFS to find the answer of this problem.
  * 
  * @param radar
  *            The current radar to search;
  */
 private static void dfs(int index) {
  Radar radar = radars[index];
  radar.visited = true;

  if (max < radar.y + radar.r) {
   max = radar.y + radar.r;
  }

  if (min > radar.y - radar.r) {
   min = radar.y - radar.r;
  }

  for (int j = 0; j < N; j++) {
   if (!radars[j].visited) {
    Radar rj = radars[j];
    long x1 = (long) radar.x;
    long x2 = (long) rj.x;
    long y1 = (long) radar.y;
    long y2 = (long) rj.y;
    long r1 = (long) radar.r;
    long r2 = (long) rj.r;
    if (Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2) <= 
      Math.pow(r1 + r2, 2)) {
     dfs(j);
    }
   }
  }
 }

http://www.cnblogs.com/ilovezyg/p/6991716.html



把上、下边界以及N个圆抽象成N+2个图节点,当边界与圆或圆与圆之间相交时表示它们连通,问题就转变为判断从上边界到下边界是否存在路径。建图后从上边界跑一遍DFS即可。
Read full article from [hihoCoder] #1307 : 穿越禁区 解题报告 - Jonah的专栏 - 博客频道 - CSDN.NET

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts