oj.uz

Submission #780929

# Submission time Handle Problem Language Result Execution time Memory
780929 2023-07-12T14:44:54 Z boris_mihov Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 649 ms 56964 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
#include <set>

typedef long long llong;
const int MAXN = 500000 + 10;
const int INF  = 1e9;

struct Person
{
    int x, e;
    friend bool operator > (const Person &a, const Person &b)
    {
        return a.e > b.e;
    }
};

int n;
Person p[MAXN];
std::set <std::pair <int,int>> left, right;

void solve()
{
    int ans = 0;
    std::sort(p + 1, p + 1 + n, std::greater <Person> ());
    
    for (int i = 1 ; i <= n ; ++i)
    {
        bool thereIs = false;
        
        auto it = left.lower_bound({p[i].e - p[i].x, 0});
        if (it != left.end() && it->second >= p[i].x)
        {
            thereIs = true;
        }

        it = right.lower_bound({p[i].x + p[i].e, 0});
        if (it != right.end() && it->second <= p[i].x)
        {
            thereIs = true;
        }
        
        if (!thereIs)
        {
            ans++;
            left.insert({p[i].e - p[i].x, p[i].x});
            right.insert({p[i].x + p[i].e, p[i].x});
        }
    }

    std::cout << ans << '\n';
}   

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> p[i].x >> p[i].e;
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    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 99 ms 12172 KB Output is correct
3 Correct 103 ms 8916 KB Output is correct
4 Correct 154 ms 9348 KB Output is correct
5 Correct 61 ms 9120 KB Output is correct
6 Correct 649 ms 56028 KB Output is correct
7 Correct 389 ms 34248 KB Output is correct
8 Correct 164 ms 14392 KB Output is correct
9 Correct 93 ms 14068 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 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 3 ms 288 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 1 ms 212 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 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 3 ms 288 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 1 ms 212 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 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 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 0 ms 212 KB Output is correct
2 Correct 99 ms 12172 KB Output is correct
3 Correct 103 ms 8916 KB Output is correct
4 Correct 154 ms 9348 KB Output is correct
5 Correct 61 ms 9120 KB Output is correct
6 Correct 649 ms 56028 KB Output is correct
7 Correct 389 ms 34248 KB Output is correct
8 Correct 164 ms 14392 KB Output is correct
9 Correct 93 ms 14068 KB Output is correct
10 Correct 1 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 1 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 1 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 3 ms 288 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 1 ms 212 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 98 ms 9344 KB Output is correct
37 Correct 122 ms 11744 KB Output is correct
38 Correct 141 ms 13948 KB Output is correct
39 Correct 128 ms 10828 KB Output is correct
40 Correct 152 ms 13876 KB Output is correct
41 Correct 140 ms 13788 KB Output is correct
42 Correct 127 ms 13900 KB Output is correct
43 Correct 216 ms 24936 KB Output is correct
44 Correct 119 ms 13896 KB Output is correct
45 Correct 593 ms 56964 KB Output is correct