usaco Crazy Fences

  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

  INPUT FORMAT:

  * 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.

  SAMPLE INPUT (file crazy.in):

  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

  INPUT DETAILS: There are 7 fences and 3 cows.

  OUTPUT FORMAT:

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

  SAMPLE OUTPUT (file crazy.out):

  2

  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.

  官方题解:http://www.usaco.org/current/data/sol_crazy_bronze.html

  看完题解之后豁然开朗。学习到一个压缩的技巧。

View Code
int compress(int a[3010], int z) {
    memcpy(t, a, sizeof(t));
    sort(t, t + z);
    int nz = unique(t, t + z) - t;
    for (int i = 0; i < z; i++) {
        a[i] = (lower_bound(t, t + nz, a[i]) - t) * 2;
    }
    return nz * 2;
}

把大规模的范围有用的东西挑出来然后处理。

  silver大数据范围题解这里:http://www.usaco.org/current/data/sol_crazy_silver.html

转载于:https://www.cnblogs.com/RainingDays/archive/2013/05/13/3075970.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值