페이지가 로드되지 않나요? 여기를 눌러보면 고쳐질 수도 있어요.
Placeholder

#3807

Crazy Fences 1초 128MB

문제

Problem 3: Crazy Fences [Brian Dean, 2012]

After visiting a modern art museum, Farmer John decides to re-design his farm by moving all of the N (1 <= N <= 500) fences between his pastures! Each fence is describe by either a horizontal or a vertical line segment in the 2D plane. If two fences meet, they do so only at their endpoints.

FJ has C cows (1 <= C <= 500) on his farm. Each cow resides at a point in the 2D plane that is not on any fence, and no two cows reside at the same point. Two cows are said to be in the same community if one could walk to the other without touching any fences. Please help FJ determine the size of the largest community.

PROBLEM NAME: crazy


입력

* Line 1: Two space-separated integers, N and C.

* Lines 2..1+N: Each line contains four integers: x1, y1, x2, y2. These describe a fence running from point (x1,y1) to point (x2,y2). Each fence is either vertical (x1=x2) or horizontal (y1=y2). All coordinates are in the range 0 .. 1,000,000.

* Lines 2+N..1+N+C: Each line contains two integers x and y describing a cow at position (x,y). All coordinates are in the range 0 .. 1,000,000.


출력

* Line 1: The number of cows in the largest community.


예제1

입력
7 3
0 0 10 0
10 0 10 5
12 5 10 5
10 5 1 5
12 5 12 7
0 7 12 7
0 7 0 0
3 4
6 6
17 3
출력
2

INPUT DETAILS:

There are 7 fences and 3 cows.

OUTPUT DETAILS:

Cows #1 and #2 both belong to the same community, since they can visit each-other without touching any fences. Cow #3 cannot reach cow #1 or cow #2 without crossing a fence.


출처

USACO 2012 December Bronze

역링크 공식 문제집만