USACO 2011 November Contest, Gold Division- Cow Steeplechase > 문제은행 : 정보올림피아드&알고리즘




3736 : Cow Steeplechase

제한시간
1000 ms   
메모리제한
128 MB   
해결횟수
0 회   
시도횟수
0 회   

문제

Farmer John has a brilliant idea for the next great spectator sport: Cow Steeplechase! As everyone knows, regular steeplechase involves a group of horses that race around a course filled with obstacles they must jump over.

 

FJ figures the same contest should work with highly-trained cows, as long as the obstacles are made short enough.

 

In order to design his course, FJ makes a diagram of all the N (1 <= N <= 250) possible obstacles he could potentially build. 

 

Each one is represented by a line segment in the 2D plane that is parallel to the horizontal or vertical axis. Obstacle i has distinct endpoints (X1_i, Y1_i) and (X2_i, Y2_i) (1 <= X1_i, Y1_i, X2_i, Y2_i <= 1,000,000,000). An example is as follows:

 

   --+-------   

-----+-----

  ---+---     |

     |     |  |

   --+-----+--+-   |

     |     |  |  | |

     |   --+--+--+-+-

           |  |  | |

              |

 

FJ would like to build as many of these obstacles as possible, subject to

the constraint that no two of them intersect. Starting with the diagram

above, FJ can build 7 obstacles:

 

   ----------   

-----------

  -------     |

           |  |

           |  |    |

           |  |  | |

           |  |  | |

           |  |  | |

              |

 

Two segments are said to intersect if they share any point in common, even an endpoint of one or both of the segments.  FJ is certain that no two horizontal segments in the original input diagram will intersect, and that similarly no two vertical segments in the input diagram will intersect.

 

Please help FJ determine the maximum number of obstacles he can build.​ 


입력형식

* Line 1: A single integer: N.

* Lines 2..N+1: Line i+1 contains four space-separated integers

               representing an obstacle: X1_i, Y1_i, X2_i, and Y2_i.

 


출력형식

* Line 1: The maximum number of non-crossing segments FJ can choose. 


입력 예

3
4 5 10 5
6 2 6 12
8 3 8 5

출력 예

2

Hint!

* INPUT DETAILS:

 

There are three potential obstacles. The first is a horizontal segment

connecting (4, 5) to (10, 5); the second and third are vertical segments

connecting (6, 2) to (6, 12) and (8, 3) to (8, 5).

 

 

*OUTPUT DETAILS:

 

The optimal solution is to choose both vertical segments.​ 




경기도 안양시 동안구 평촌대로 109 협성골드프라자 601호

TEL : 031-360-4144 FAX : 031-388-0996 E-mail : hancomc@hotmail.com, comkiwer@naver.com

Copyrightⓒ 2010 jungol. All right reserved.

TOP