| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 4462 |
2013-10-07T14:25:03 Z |
model_code |
사냥꾼 (KOI13_hunter) |
C++ |
|
64 ms |
2260 KB |
#include <stdio.h>
#include <algorithm>
#include <time.h>
using namespace std;
struct point {
int x, y;
point () {}
point (int x, int y) : x(x), y(y) {}
bool operator < (const point& rhs) const { return x < rhs.x; }
};
int m, n, l;
int x[100000];
point animal[100000];
int main ()
{
scanf ("%d%d%d", &m, &n, &l);
for (int i=0; i<m; i++) scanf ("%d", &x[i]);
for (int i=0; i<n; i++) scanf ("%d%d", &animal[i].x, &animal[i].y);
sort (x, x+m);
sort (animal, animal+n);
int answer = 0;
for (int i=0, j=0; i<n; i++) {
while (j<m && x[j] < animal[i].x)
j++;
bool flag = false;
if (j>0 && animal[i].x - x[j-1] + animal[i].y <= l) flag = true;
if (j<m && x[j] - animal[i].x + animal[i].y <= l) flag = true;
if (flag) answer++;
}
printf ("%d", answer);
return 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 |
| # |
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 |
| # |
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 |
| # |
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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
2260 KB |
Output is correct |
| 2 |
Correct |
44 ms |
2260 KB |
Output is correct |
| 3 |
Correct |
52 ms |
2260 KB |
Output is correct |
| 4 |
Correct |
48 ms |
2260 KB |
Output is correct |
| 5 |
Correct |
60 ms |
2260 KB |
Output is correct |
| 6 |
Correct |
64 ms |
2260 KB |
Output is correct |
| 7 |
Correct |
64 ms |
2260 KB |
Output is correct |
| 8 |
Correct |
52 ms |
2260 KB |
Output is correct |
| 9 |
Correct |
60 ms |
2260 KB |
Output is correct |
| 10 |
Correct |
64 ms |
2260 KB |
Output is correct |
