oj.uz

Submission #769065

# Submission time Handle Problem Language Result Execution time Memory
769065 2023-06-29T06:39:10 Z danikoynov Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 623 ms 34688 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 5e5 + 10;

struct point
{
    int x, y;
} p[maxn];

bool cmp(const point &p1, const point &p2)
{
    return p1.y > p2.y;
}

int n;
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> p[i].x >> p[i].y;
    }

    sort(p + 1, p + n + 1, cmp);
    int ans = 0;
    set < pair < int, int > > st;
    for (int i = 1; i <= n; i ++)
    {
        pair < int, int > cur = {p[i].x, i};
        st.insert(cur);
        set < pair < int, int > > :: iterator it = st.find(cur), hp;
        bool covered = false;
        if (it != st.begin())
        {
            hp = prev(it);
            if (cur.first - hp -> first <= p[hp -> second].y - p[cur.second].y)
                covered = true;
        }
        if (next(it) != st.end())
        {
            hp = next(it);
            if (hp -> first - cur.first <= p[hp -> second].y - p[cur.second].y)
                covered = true;
        }
        if (!covered)
            ans ++;
        else
            st.erase(it);
    }

    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 116 ms 6660 KB Output is correct
3 Correct 172 ms 8448 KB Output is correct
4 Correct 387 ms 8492 KB Output is correct
5 Correct 244 ms 9096 KB Output is correct
6 Correct 623 ms 34688 KB Output is correct
7 Correct 508 ms 23984 KB Output is correct
8 Correct 384 ms 14144 KB Output is correct
9 Correct 301 ms 13916 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 116 ms 6660 KB Output is correct
3 Correct 172 ms 8448 KB Output is correct
4 Correct 387 ms 8492 KB Output is correct
5 Correct 244 ms 9096 KB Output is correct
6 Correct 623 ms 34688 KB Output is correct
7 Correct 508 ms 23984 KB Output is correct
8 Correct 384 ms 14144 KB Output is correct
9 Correct 301 ms 13916 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 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 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 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 254 ms 9252 KB Output is correct
37 Correct 319 ms 11748 KB Output is correct
38 Correct 394 ms 13772 KB Output is correct
39 Correct 319 ms 10760 KB Output is correct
40 Correct 395 ms 13812 KB Output is correct
41 Correct 376 ms 13792 KB Output is correct
42 Correct 400 ms 13932 KB Output is correct
43 Correct 352 ms 18864 KB Output is correct
44 Correct 342 ms 13912 KB Output is correct
45 Correct 548 ms 32884 KB Output is correct