oj.uz

Submission #786098

# Submission time Handle Problem Language Result Execution time Memory
786098 2023-07-18T03:14:35 Z 12345678 Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 130 ms 17180 KB 
#include <bits/stdc++.h>

using namespace std;

int n, x, y, h;
stack<pair<int, int>> s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    vector<pair<int, int>> v(n);
    for (auto &[x, y]:v) cin>>x>>y;
    sort(v.begin(), v.end());
    for (auto [x, y]:v)
    {
        if (s.empty())
        {
            s.push({x, y});
            continue;
        }
        if (s.top().second-y>=x-s.top().first) continue;
        while (!s.empty()&&y-s.top().second>=x-s.top().first) s.pop();
        s.push({x, y});
    }
    cout<<s.size();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 35 ms 4648 KB Output is correct
3 Correct 42 ms 5692 KB Output is correct
4 Correct 107 ms 12892 KB Output is correct
5 Correct 54 ms 9120 KB Output is correct
6 Correct 124 ms 17180 KB Output is correct
7 Correct 122 ms 15604 KB Output is correct
8 Correct 110 ms 13944 KB Output is correct
9 Correct 85 ms 13952 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
36.0 / 36.0

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

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 35 ms 4648 KB Output is correct
3 Correct 42 ms 5692 KB Output is correct
4 Correct 107 ms 12892 KB Output is correct
5 Correct 54 ms 9120 KB Output is correct
6 Correct 124 ms 17180 KB Output is correct
7 Correct 122 ms 15604 KB Output is correct
8 Correct 110 ms 13944 KB Output is correct
9 Correct 85 ms 13952 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 76 ms 9296 KB Output is correct
37 Correct 99 ms 11812 KB Output is correct
38 Correct 120 ms 13812 KB Output is correct
39 Correct 107 ms 10844 KB Output is correct
40 Correct 115 ms 13772 KB Output is correct
41 Correct 120 ms 13772 KB Output is correct
42 Correct 130 ms 13808 KB Output is correct
43 Correct 116 ms 13824 KB Output is correct
44 Correct 118 ms 13812 KB Output is correct
45 Correct 102 ms 14072 KB Output is correct