oj.uz

Submission #7415

# Submission time Handle Problem Language Result Execution time Memory
7415 2014-08-05T04:43:56 Z gs13068 사냥꾼 (KOI13_hunter) C++
100 / 100
 80 ms 2260 KB 
#include<cstdio>
#include<algorithm>

int a[100000];
std::pair<int,int> b[100000];

int main()
{
  int i,j,n,m,l;
  scanf("%d%d%d",&n,&m,&l);
  for(i=0;i<n;i++)scanf("%d",&a[i]);
  for(j=0;j<m;j++)scanf("%d%d",&b[j].first,&b[j].second);
  std::sort(a,a+n);
  i=0;
  for(j=0;j<m;j++)if(std::lower_bound(a,a+n,b[j].first+b[j].second-l)<std::upper_bound(a,a+n,b[j].first-b[j].second+l))i++;
  printf("%d",i);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Correct 0 ms 2260 KB Output is correct
4 Correct 0 ms 2260 KB Output is correct
5 Correct 0 ms 2260 KB Output is correct
6 Correct 0 ms 2260 KB Output is correct
7 Correct 0 ms 2260 KB Output is correct
8 Correct 0 ms 2260 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Correct 0 ms 2260 KB Output is correct
4 Correct 0 ms 2260 KB Output is correct
5 Correct 0 ms 2260 KB Output is correct
6 Correct 0 ms 2260 KB Output is correct
7 Correct 0 ms 2260 KB Output is correct
8 Correct 0 ms 2260 KB Output is correct
9 Correct 0 ms 2260 KB Output is correct
10 Correct 0 ms 2260 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Correct 0 ms 2260 KB Output is correct
4 Correct 0 ms 2260 KB Output is correct
5 Correct 0 ms 2260 KB Output is correct
6 Correct 0 ms 2260 KB Output is correct
7 Correct 0 ms 2260 KB Output is correct
8 Correct 0 ms 2260 KB Output is correct
9 Correct 0 ms 2260 KB Output is correct
10 Correct 0 ms 2260 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 2260 KB Output is correct
2 Correct 56 ms 2260 KB Output is correct
3 Correct 56 ms 2260 KB Output is correct
4 Correct 44 ms 2260 KB Output is correct
5 Correct 68 ms 2260 KB Output is correct
6 Correct 76 ms 2260 KB Output is correct
7 Correct 72 ms 2260 KB Output is correct
8 Correct 64 ms 2260 KB Output is correct
9 Correct 72 ms 2260 KB Output is correct
10 Correct 80 ms 2260 KB Output is correct