oj.uz

Submission #909410

# Submission time Handle Problem Language Result Execution time Memory
909410 2024-01-17T07:56:00 Z LOLOLO Lightning Rod (NOI18_lightningrod) C++17
100 / 100
 1525 ms 262144 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pa;

const ll N = 1e7 + 100;
const ll MOD = 1e9 + 7;
const ll INF = 1e12;
int pr[N], suff[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;

    vector <pair <int, int>> v;
    for (int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        v.push_back({x, y});
    }

    pr[0] = v[0].fi + v[0].se;
    for (int i = 1; i < n; i++) {
        pr[i] = max(pr[i - 1], v[i].fi + v[i].se);
    }

    suff[n - 1] = v[n - 1].fi - v[n - 1].se;
    for (int i = n - 2; i >= 0; i--) {
        suff[i] = min(suff[i + 1], v[i].fi - v[i].se);
    }

    int cnt = 0;
    if (suff[1] > v[0].fi - v[0].se)
        cnt++;

    if (pr[n - 2] < v[n - 1].fi + v[n - 1].se)
        cnt++;

    for (int i = 1; i < n - 1; i++) {
        if (suff[i + 1] > v[i].fi - v[i].se && pr[i - 1] < v[i].fi + v[i].se) {
            cnt++;
        }
    }

    cout << cnt << '\n';
    return 0;
}

// x(i) - x(j) <= y(i) - y(j)
// x(i) - y(i) <= x(j) - y(j)

// x(j) - x(i) <= y(i) - y(j)
// x(j) + y(j) <= x(i) + y(i)

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1245 ms 174800 KB Output is correct
2 Correct 1282 ms 262144 KB Output is correct
3 Correct 1266 ms 260160 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 36 ms 11808 KB Output is correct
15 Correct 35 ms 11884 KB Output is correct
16 Correct 32 ms 10952 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1255 ms 163080 KB Output is correct
2 Correct 1241 ms 254328 KB Output is correct
3 Correct 1287 ms 249064 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1245 ms 174800 KB Output is correct
2 Correct 1282 ms 262144 KB Output is correct
3 Correct 1266 ms 260160 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 36 ms 11808 KB Output is correct
18 Correct 35 ms 11884 KB Output is correct
19 Correct 32 ms 10952 KB Output is correct
20 Correct 1255 ms 163080 KB Output is correct
21 Correct 1241 ms 254328 KB Output is correct
22 Correct 1287 ms 249064 KB Output is correct
23 Correct 1525 ms 262144 KB Output is correct
24 Correct 1485 ms 262144 KB Output is correct
25 Correct 1367 ms 262144 KB Output is correct