제출 #4949

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
4949		hana5505	사냥꾼 (KOI13_hunter)	C++98	100 / 100	76 ms	12804 KiB

hunter

#include<stdio.h>
#include<algorithm>
using namespace std;
struct pp{
    int x,y;
}animal[1000001];
int hunter[1000001];
int ab(int k){
    if(k<0) return -k;
    return k;
}
int main()
{
    int m,n,l,i,j,cnt=0,ans=0;
 
    scanf("%d %d %d",&m,&n,&l);
    for(i=1;i<=m;i++)
        scanf("%d",&hunter[i]);
    for(i=1;i<=n;i++)
        scanf("%d %d",&animal[i].x,&animal[i].y);
 
    sort(hunter+1,hunter+m+1);
 
    for(i=1;i<=n;i++){
        cnt=0;
        j=lower_bound(hunter+1,hunter+m+1,animal[i].x)-hunter;
        if(j-1>=1){
            if(ab(hunter[j-1]-animal[i].x)+animal[i].y<=l) cnt++;
        }
        if(j>=1 && j<=m){
            if(ab(hunter[j]-animal[i].x)+animal[i].y<=l) cnt++;
        }
        if(j+1<=m){
            if(ab(hunter[j+1]-animal[i].x)+animal[i].y<=l) cnt++;
        }
        if(cnt) ans++;
    }
 
    printf("%d",ans);
}

• Subtask 1: 10 / 10
• Subtask 2: 17 / 17
• Subtask 3: 21 / 21
• Subtask 4: 22 / 22
• Subtask 5: 30 / 30