Submission #5066

#	Time	Username	Problem	Language	Result	Execution time	Memory
5066		Namnamseo	사냥꾼 (KOI13_hunter)	C++98	100 / 100	68 ms	2140 KiB

hunter

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

using namespace std;

int main()
{
    int n,m,l,ans=0;
    bool tmp;
    int i,j;
    scanf("%d%d%d",&m,&n,&l);
    int hunter[100001];
    pair<int,int> animal[100001];
    for(i=0;i<m;i++) scanf("%d",&hunter[i]);
    for(i=0;i<n;i++) scanf("%d%d",&animal[i].first,&animal[i].second);
    sort(hunter,hunter+m);
    sort(animal,animal+n);
    for(i=0,j=0;i<n;i++){
        while(j<m && hunter[j]<animal[i].first) j++;
        tmp=false;
        if(j>0){
            if(animal[i].first - hunter[j-1] + animal[i].second <= l) tmp=true;
        }
        if(j<m){
            if(hunter[j]-animal[i].first+animal[i].second <= l) tmp=true;
        }
        if(tmp) ans++;
    }
    printf("%d",ans);
    return 0;   
}

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