# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979140 | MilosMilutinovic | Lightning Rod (NOI18_lightningrod) | C++14 | 2095 ms | 215660 KiB |
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;
const int MAX = 10000005;
int x[MAX], y[MAX], ord[MAX];
bool cmp(int i, int j) {
return make_pair(x[i], -y[i]) < make_pair(x[j], -y[j]);
}
int main() {
int n, a, b, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
x[i] = a - b;
y[i] = a + b;
ord[i] = i;
}
sort(ord, ord + n, cmp);
int ans = 0, mx = -1;
for (int i = 0; i < n; i++) {
if (mx < y[ord[i]]) {
ans += 1;
mx = y[ord[i]];
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |