oj.uz

Submission #916480

# Submission time Handle Problem Language Result Execution time Memory
916480 2024-01-26T01:52:28 Z GrandTiger1729 Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 602 ms 37520 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n);

    for (int i = 0; i < n; i++)
    {
        cin >> a[i].first >> a[i].second;
    }
    multiset<pair<int, int>> st(a.begin(), a.end());
    sort(a.begin(), a.end(), [&](auto x, auto y)
    {
        return x.second > y.second;
    });
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        if (st.find(a[i]) == st.end())
        {
            continue;
        }
        ans++;
        auto it = st.find(a[i]);
        while (it != st.begin())
        {
            auto it2 = it;
            it2--;
            if (abs(a[i].first - it2->first) <= a[i].second - it2->second)
            {
                st.erase(it2);
            }
            else
            {
                break;
            }
        }
        while (it != st.end())
        {
            auto it2 = it;
            it++;
            if (abs(a[i].first - it2->first) <= a[i].second - it2->second)
            {
                st.erase(it2);
            }
            else
            {
                break;
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 90 ms 9648 KB Output is correct
3 Correct 122 ms 13652 KB Output is correct
4 Correct 316 ms 34644 KB Output is correct
5 Correct 82 ms 24656 KB Output is correct
6 Correct 563 ms 36948 KB Output is correct
7 Correct 602 ms 37512 KB Output is correct
8 Correct 341 ms 37372 KB Output is correct
9 Correct 128 ms 37456 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 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 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 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 90 ms 9648 KB Output is correct
3 Correct 122 ms 13652 KB Output is correct
4 Correct 316 ms 34644 KB Output is correct
5 Correct 82 ms 24656 KB Output is correct
6 Correct 563 ms 36948 KB Output is correct
7 Correct 602 ms 37512 KB Output is correct
8 Correct 341 ms 37372 KB Output is correct
9 Correct 128 ms 37456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 1 ms 348 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 247 ms 24912 KB Output is correct
37 Correct 299 ms 31700 KB Output is correct
38 Correct 395 ms 37520 KB Output is correct
39 Correct 347 ms 34388 KB Output is correct
40 Correct 386 ms 37372 KB Output is correct
41 Correct 365 ms 37200 KB Output is correct
42 Correct 373 ms 37456 KB Output is correct
43 Correct 428 ms 36352 KB Output is correct
44 Correct 354 ms 37488 KB Output is correct
45 Correct 544 ms 33460 KB Output is correct