oj.uz

Submission #875598

# Submission time Handle Problem Language Result Execution time Memory
875598 2023-11-20T06:50:04 Z hmm789 Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 133 ms 29704 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353
 
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, ans = 1, idx = 0;
    cin >> n;
    int x[n], e[n], b[n];
    pair<int, int> a[n];
    for(int i = 0; i < n; i++) {
        cin >> x[i] >> e[i];
        a[i] = {x[i]+e[i], i};
    }
    sort(a, a+n);
    for(int i = 0; i < n; i++) b[i] = INF;
    for(int i = 0; i < n; i++) {
        b[idx] = min(b[idx], x[a[i].second]-e[a[i].second]);
        if(i == n-1 || a[i].first != a[i+1].first) idx++;
    }
    for(int i = idx-2; i >= 0; i--) b[i] = min(b[i], b[i+1]);
    for(int i = 0; i < idx-1; i++) if(b[i] < b[i+1]) ans++;
    cout << ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 29 ms 5464 KB Output is correct
3 Correct 43 ms 7260 KB Output is correct
4 Correct 117 ms 18776 KB Output is correct
5 Correct 57 ms 13148 KB Output is correct
6 Correct 122 ms 20000 KB Output is correct
7 Correct 126 ms 20000 KB Output is correct
8 Correct 127 ms 20000 KB Output is correct
9 Correct 94 ms 19804 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 452 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 472 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 29 ms 5464 KB Output is correct
3 Correct 43 ms 7260 KB Output is correct
4 Correct 117 ms 18776 KB Output is correct
5 Correct 57 ms 13148 KB Output is correct
6 Correct 122 ms 20000 KB Output is correct
7 Correct 126 ms 20000 KB Output is correct
8 Correct 127 ms 20000 KB Output is correct
9 Correct 94 ms 19804 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 452 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 83 ms 19808 KB Output is correct
37 Correct 107 ms 25188 KB Output is correct
38 Correct 133 ms 29656 KB Output is correct
39 Correct 114 ms 26388 KB Output is correct
40 Correct 126 ms 29456 KB Output is correct
41 Correct 126 ms 29468 KB Output is correct
42 Correct 129 ms 29704 KB Output is correct
43 Correct 123 ms 28428 KB Output is correct
44 Correct 127 ms 29528 KB Output is correct
45 Correct 107 ms 25680 KB Output is correct