#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<pair<int, int>> arr(n);
for (int i = 0; i < n; ++i) cin >> arr[i].second >> arr[i].first;
sort(arr.begin(), arr.end());
reverse(arr.begin(), arr.end());
set<pair<int, int>> given;
given.insert({0, 0});
given.insert({1000000007, 0});
int ans = 0;
for (pair<int, int> p : arr) {
int x = p.second, e = p.first;
pair<int, int> r = *given.upper_bound({x, e}), l = *--given.upper_bound({x, e});
if (abs(r.first - x) <= r.second - e || abs(l.first - x) <= l.second - e) continue;
++ans;
given.insert({x, e});
}
cout << ans << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
108 ms |
9108 KB |
Output is correct |
| 3 |
Correct |
140 ms |
8716 KB |
Output is correct |
| 4 |
Correct |
304 ms |
13132 KB |
Output is correct |
| 5 |
Correct |
181 ms |
9100 KB |
Output is correct |
| 6 |
Correct |
444 ms |
34636 KB |
Output is correct |
| 7 |
Correct |
413 ms |
24032 KB |
Output is correct |
| 8 |
Correct |
348 ms |
14064 KB |
Output is correct |
| 9 |
Correct |
281 ms |
13932 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
296 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
304 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
300 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
300 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
296 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
304 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
300 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
300 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
212 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
308 KB |
Output is correct |
| 26 |
Correct |
1 ms |
312 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
108 ms |
9108 KB |
Output is correct |
| 3 |
Correct |
140 ms |
8716 KB |
Output is correct |
| 4 |
Correct |
304 ms |
13132 KB |
Output is correct |
| 5 |
Correct |
181 ms |
9100 KB |
Output is correct |
| 6 |
Correct |
444 ms |
34636 KB |
Output is correct |
| 7 |
Correct |
413 ms |
24032 KB |
Output is correct |
| 8 |
Correct |
348 ms |
14064 KB |
Output is correct |
| 9 |
Correct |
281 ms |
13932 KB |
Output is correct |
| 10 |
Correct |
0 ms |
296 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
304 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
300 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
212 KB |
Output is correct |
| 23 |
Correct |
0 ms |
300 KB |
Output is correct |
| 24 |
Correct |
0 ms |
212 KB |
Output is correct |
| 25 |
Correct |
0 ms |
212 KB |
Output is correct |
| 26 |
Correct |
0 ms |
212 KB |
Output is correct |
| 27 |
Correct |
1 ms |
212 KB |
Output is correct |
| 28 |
Correct |
1 ms |
212 KB |
Output is correct |
| 29 |
Correct |
1 ms |
212 KB |
Output is correct |
| 30 |
Correct |
1 ms |
212 KB |
Output is correct |
| 31 |
Correct |
1 ms |
212 KB |
Output is correct |
| 32 |
Correct |
1 ms |
212 KB |
Output is correct |
| 33 |
Correct |
1 ms |
212 KB |
Output is correct |
| 34 |
Correct |
1 ms |
308 KB |
Output is correct |
| 35 |
Correct |
1 ms |
312 KB |
Output is correct |
| 36 |
Correct |
246 ms |
9328 KB |
Output is correct |
| 37 |
Correct |
304 ms |
11808 KB |
Output is correct |
| 38 |
Correct |
355 ms |
13908 KB |
Output is correct |
| 39 |
Correct |
313 ms |
10828 KB |
Output is correct |
| 40 |
Correct |
377 ms |
13832 KB |
Output is correct |
| 41 |
Correct |
375 ms |
13852 KB |
Output is correct |
| 42 |
Correct |
325 ms |
13932 KB |
Output is correct |
| 43 |
Correct |
325 ms |
18780 KB |
Output is correct |
| 44 |
Correct |
313 ms |
13932 KB |
Output is correct |
| 45 |
Correct |
392 ms |
33484 KB |
Output is correct |
