oj.uz

Submission #890696

# Submission time Handle Problem Language Result Execution time Memory
890696 2023-12-21T18:43:12 Z Marco_Escandon Advertisement 2 (JOI23_ho_t2) C++11
100 / 100
 1004 ms 72788 KB 
#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(15);
#pragma GCC optimize("Ofast")
typedef long long ll;
struct Segment_Tree{
    typedef long long ll;
    vector<ll>  ST;
    Segment_Tree(ll n){
        ST.assign(2*(n+1),-1e17);
    }
    void update(ll a, ll b){
        a+=ST.size()/2; ST[a]=b;
        for(a/=2; a>0; a=a/2)
            ST[a]=max(ST[a*2],ST[a*2+1]);
    }
    ll RMQ(ll a, ll b)
    {
        a += ST.size()/2; b += ST.size()/2;
        ll s = -1e17;
        while (a <= b) {
            if (a%2 == 1) s = max(s,ST[a++]);
            if (b%2 == 0) s = max(s,ST[b--]);
            a /= 2; b /= 2;
        }
        return s;
    }
};
int main()
{
    ll n;
    cin>>n;
    vector<pair<ll,ll>> v(n),v2(n);
    Segment_Tree l(n+2),r(n+2);
    for(int i=0; i<n; i++){
        cin>>v[i].second>>v[i].first;
        v2[i].first=v[i].second;
        v2[i].second=v[i].first;
    }
    sort(v.begin(),v.end());reverse(v.begin(),v.end());sort(v2.begin(),v2.end());
    map<pair<ll,ll>, ll> mapa;
    for(int i=0; i<n; i++)
    {
        swap(v2[i].first,v2[i].second);
        mapa[v2[i]]=i+1;
    }
    ll cont=0;
    for(int i=0; i<n; i++)
    {  		 if(l.RMQ(1,mapa[v[i]])>=v[i].second+v[i].first||r.RMQ(mapa[v[i]],n)>=v[i].first-v[i].second);
        else cont++;
        l.update(mapa[v[i]],v[i].second+v[i].first);
        r.update(mapa[v[i]],v[i].first-v[i].second);
    }
    cout<<cont;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 175 ms 18096 KB Output is correct
3 Correct 217 ms 19804 KB Output is correct
4 Correct 402 ms 38480 KB Output is correct
5 Correct 219 ms 27084 KB Output is correct
6 Correct 736 ms 69376 KB Output is correct
7 Correct 627 ms 54868 KB Output is correct
8 Correct 443 ms 41600 KB Output is correct
9 Correct 338 ms 41464 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 432 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 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 348 KB Output is correct
23 Correct 2 ms 520 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 175 ms 18096 KB Output is correct
3 Correct 217 ms 19804 KB Output is correct
4 Correct 402 ms 38480 KB Output is correct
5 Correct 219 ms 27084 KB Output is correct
6 Correct 736 ms 69376 KB Output is correct
7 Correct 627 ms 54868 KB Output is correct
8 Correct 443 ms 41600 KB Output is correct
9 Correct 338 ms 41464 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 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 432 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 432 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 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 348 KB Output is correct
32 Correct 2 ms 520 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 571 ms 48572 KB Output is correct
37 Correct 770 ms 61520 KB Output is correct
38 Correct 1004 ms 72784 KB Output is correct
39 Correct 908 ms 69676 KB Output is correct
40 Correct 963 ms 72728 KB Output is correct
41 Correct 912 ms 72444 KB Output is correct
42 Correct 722 ms 72788 KB Output is correct
43 Correct 693 ms 71788 KB Output is correct
44 Correct 624 ms 72676 KB Output is correct
45 Correct 708 ms 68980 KB Output is correct