This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<array<int, 2>> a(n);
set<int> pos;
for (auto &[x, e] : a) {
cin >> x >> e;
pos.insert(x);
}
sort(all(a));
a.erase(unique(all(a)), a.end());
if (pos.size() != a.size())
cout << 0 << '\n';
else
cout << pos.size() << '\n';
return 0;
n = a.size();
int ans = n;
for (int i = 0; i < n; i++) {
bool cov = 0;
for (int j = 0; j < n; j++) {
if (i != j && a[j][1] - a[i][1] >= abs(a[j][0] - a[i][0]))
cov = 1;
}
if (cov)
ans--;
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |