oj.uz

Submission #944534

# Submission time Handle Problem Language Result Execution time Memory
944534 2024-03-12T21:36:02 Z vladilius Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 121 ms 19660 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
 
struct node{
    int x, e;
};
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n; cin>>n;
    vector<node> t(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>t[i].x>>t[i].e;
    }
    auto cmp = [&](node a, node b){
        return a.x < b.x;
    };
    sort(t.begin() + 1, t.end(), cmp);
    vector<int> d(n + 1), s(n + 1);
    for (int i = 1; i <= n; i++){
        d[i] = t[i].e - t[i].x;
        s[i] = t[i].e + t[i].x;
    }
    vector<int> st;
    for (int i = 1; i <= n; i++){
        if (st.empty()){
            st.push_back(i);
            continue;
        }
        while (!st.empty() && t[i].x - t[st.back()].x <= t[i].e - t[st.back()].e){
            st.pop_back();
        }
        if (st.empty() || !((t[i].x - t[st.back()].x) <= t[st.back()].e - t[i].e)){
            st.push_back(i);
        }
    }
    cout<<st.size()<<"\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 28 ms 2896 KB Output is correct
3 Correct 43 ms 7128 KB Output is correct
4 Correct 96 ms 16720 KB Output is correct
5 Correct 55 ms 11808 KB Output is correct
6 Correct 112 ms 19660 KB Output is correct
7 Correct 121 ms 19156 KB Output is correct
8 Correct 104 ms 18004 KB Output is correct
9 Correct 84 ms 18004 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 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 1 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 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 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 1 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 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 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 348 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 0 ms 348 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 28 ms 2896 KB Output is correct
3 Correct 43 ms 7128 KB Output is correct
4 Correct 96 ms 16720 KB Output is correct
5 Correct 55 ms 11808 KB Output is correct
6 Correct 112 ms 19660 KB Output is correct
7 Correct 121 ms 19156 KB Output is correct
8 Correct 104 ms 18004 KB Output is correct
9 Correct 84 ms 18004 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 1 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 1 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 348 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 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 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 348 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 0 ms 348 KB Output is correct
36 Correct 75 ms 11856 KB Output is correct
37 Correct 99 ms 15188 KB Output is correct
38 Correct 112 ms 17744 KB Output is correct
39 Correct 105 ms 14712 KB Output is correct
40 Correct 113 ms 17672 KB Output is correct
41 Correct 112 ms 17748 KB Output is correct
42 Correct 106 ms 17748 KB Output is correct
43 Correct 112 ms 17404 KB Output is correct
44 Correct 119 ms 17908 KB Output is correct
45 Correct 97 ms 16116 KB Output is correct