oj.uz

Submission #835089

# Submission time Handle Problem Language Result Execution time Memory
835089 2023-08-23T08:01:19 Z jasmin Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 138 ms 29608 KB 
//JOI 2023 Final Round
#include<bits/stdc++.h>
using namespace std;
#define int long long

const int INF=1e18;

void solve(){
    int n;
    cin >> n;
    vector<pair<int,int> > a(n);
    for(int i=0; i<n; i++){
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());

    set<pair<int,int> > given;
    int ans=0;
    for(int i=0; i<n; i++){
        auto [e, x]=a[i];

        auto r=given.upper_bound({x, e});
        if(r!=given.end()){

            auto [x2, e2]=*r;
            if(e2-e >= x2-x) continue;
        }
        if(r!=given.begin()){

            auto [x2, e2] =*prev(r);
            if(e2-e >= x-x2) continue;
        }

        ans++;
        given.insert({x, e});
    }

    cout << ans << "\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<pair<int,int> > a(n);
    vector<pair<pair<int,int> ,int> > sorted(n);
    for(int i=0; i<n; i++){
        int x, e;
        cin >> x >> e;
        
        a[i] = {x, e};

        sorted[i]={{e-x, e+x}, i};
    }
    sort(sorted.begin(), sorted.end());
    reverse(sorted.begin(), sorted.end());

    int maxi=-INF;
    int ans=0;
    for(auto [val, i]: sorted){
        auto [x, e] = a[i];

        if(x+e <= maxi) continue;

        maxi = x+e;
        ans++;
    }
    cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 5332 KB Output is correct
3 Correct 45 ms 7252 KB Output is correct
4 Correct 125 ms 18428 KB Output is correct
5 Correct 62 ms 13012 KB Output is correct
6 Correct 129 ms 19884 KB Output is correct
7 Correct 128 ms 19884 KB Output is correct
8 Correct 130 ms 19884 KB Output is correct
9 Correct 96 ms 19892 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 212 KB Output is correct
5 Correct 0 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 1 ms 316 KB Output is correct
18 Correct 1 ms 324 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 212 KB Output is correct
5 Correct 0 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 1 ms 316 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 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 332 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 0 ms 212 KB Output is correct
2 Correct 31 ms 5332 KB Output is correct
3 Correct 45 ms 7252 KB Output is correct
4 Correct 125 ms 18428 KB Output is correct
5 Correct 62 ms 13012 KB Output is correct
6 Correct 129 ms 19884 KB Output is correct
7 Correct 128 ms 19884 KB Output is correct
8 Correct 130 ms 19884 KB Output is correct
9 Correct 96 ms 19892 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 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 1 ms 316 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 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 332 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 84 ms 19692 KB Output is correct
37 Correct 110 ms 25060 KB Output is correct
38 Correct 127 ms 29476 KB Output is correct
39 Correct 115 ms 26416 KB Output is correct
40 Correct 133 ms 29484 KB Output is correct
41 Correct 134 ms 29472 KB Output is correct
42 Correct 128 ms 29472 KB Output is correct
43 Correct 127 ms 28536 KB Output is correct
44 Correct 138 ms 29608 KB Output is correct
45 Correct 110 ms 25692 KB Output is correct