Submission #5326

#	Time	Username	Problem	Language	Result	Execution time	Memory
5326		baneling100	사냥꾼 (KOI13_hunter)	C++98	100 / 100	88 ms	2260 KiB

hunter

#include <stdio.h>
#include <algorithm>

using namespace std;

int m, n, l, shoot[100001], x[100001], y[100001], ans;

void input(void)
{
    int i;

    scanf("%d %d %d",&m,&n,&l);
    for(i=1 ; i<=m ; i++)
        scanf("%d",&shoot[i]);
    sort(shoot+1,shoot+m+1);
    for(i=1 ; i<=n ; i++)
        scanf("%d %d",&x[i],&y[i]);
}

void process(void)
{
    int i, a, b, left, right;

    for(i=1 ; i<=n ; i++)
    {
        a=x[i]-l+y[i];
        b=x[i]+l-y[i];
        left=lower_bound(&shoot[1],&shoot[m]+1,a)-shoot;
        right=upper_bound(&shoot[1],&shoot[m]+1,b)-shoot-1;
        if(left<=right)
            ans++;
    }
}

void output(void)
{
    printf("%d",ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

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