2191: 【USACO】Crowded Cows

最新推荐文章于 2024-10-01 04:50:10 发布

zhaotengchen37

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量92

点赞数

分类专栏：算法 c++ 文章标签：算法 c++

本文链接：https://blog.csdn.net/ztc37/article/details/127701247

版权

c++ 同时被 2 个专栏收录

45 篇文章 3 订阅

订阅专栏

算法

15 篇文章 0 订阅

订阅专栏

2191: 【USACO】Crowded Cows

时间限制: 1.000 Sec 内存限制: 64 MB
提交: 26 解决: 19
[命题人:][下载数据: 90]

提交状态报告

题目描述

Farmer John's N cows (1 <= N <= 50,000) are grazing along a one-dimensional fence. Cow i is standing at location x(i) and has height h(i) (1 <= x(i),h(i) <= 1,000,000,000). A cow feels "crowded" if there is another cow at least twice her height within distance D on her left, and also another cow at least twice her height within distance D on her right (1 <= D <= 1,000,000,000). Since crowded cows produce less milk, Farmer John would like to count the number of such cows. Please help him.

输入

* Line 1: Two integers, N and D. * Lines 2..1+N: Line i+1 contains the integers x(i) and h(i). The locations of all N cows are distinct.

输出

* Line 1: The number of crowded cows.

样例

输入复制

6 4 10 3 6 2 5 3 9 7 3 6 11 2

输出复制

提示

INPUT DETAILS: There are 6 cows, with a distance threshold of 4 for feeling crowded. Cow #1 lives at position x=10 and has height h=3, and so on. OUTPUT DETAILS: The cows at positions x=5 and x=6 are both crowded.

来源/分类

USACO 2013 November Silver

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

struct Cow {
    long long x , hi;
    bool operator < (const Cow &a) const {
        return hi > a.hi;
    }
};
Cow tag[50005];
long long n;
long long d , ans = 0;

long long myabs(long long x) {
    return x>0?x:(-x);
}

int main() {
    scanf("%d%lld",&n,&d);
    for(long long i=1; i<=n; i++)
        scanf("%lld%lld",&tag[i].x,&tag[i].hi);
    sort(tag+1 , tag+n+1);
    for(long long i=1; i<=n; i++) {
        long long flag1 = 0 , flag2 = 0;
        for(long long j=1; j<i; j++) {
            if(tag[j].hi < tag[i].hi*2)
                break;
            if(myabs(tag[j].x-tag[i].x) <= d) {
                if(tag[j].x > tag[i].x)
                    flag1 = 1;
                if(tag[j].x < tag[i].x)
                    flag2 = 1;
                if(flag1 && flag2) {
                    ans++;
                    break;
                }
            }
        }   
    }
    printf("%lld",ans);
    return 0;
}