oj.uz

Submission #954998

# Submission time Handle Problem Language Result Execution time Memory
954998 2024-03-29T06:21:55 Z Otalp Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 600 ms 39412 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second

int us[500100];


void solve(){
    int n;
    cin>>n;
    vector<pii> q;
    
    for(int i=1; i<=n; i++){
        int l, r;
        cin>>l>>r;
        q.pb({l, r});
    }
    sort(q.begin(), q.end());
    multiset<pii> d1, d2;
    
    for(int i=0; i<n; i++){
        d2.insert({q[i].ff + q[i].ss, i});
    }
    for(int i=0; i<n; i++){
        if(us[i]) continue;
        d2.erase(d2.find({q[i].ff + q[i].ss, i}));
        int x = q[i].ff - q[i].ss;
        while(d1.size() and (*d1.rbegin()).ff >= x){
            us[(*d1.rbegin()).ss] = 1;
            d1.erase(--(d1.end()));
        }
        x = q[i].ff + q[i].ss;
        while(d2.size() and (*d2.begin()).ff <= x){
            us[(*d2.begin()).ss] = 1;
            d2.erase(d2.begin());
        }
        d1.insert({q[i].ff - q[i].ss, i});
    }
    int ans = 0;
    for(int i=0; i<n; i++){
        if(us[i] == 0) ans++;
    }
    cout<<ans;

}


int main(){
    solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 109 ms 10244 KB Output is correct
3 Correct 158 ms 14260 KB Output is correct
4 Correct 367 ms 36532 KB Output is correct
5 Correct 242 ms 26260 KB Output is correct
6 Correct 444 ms 38772 KB Output is correct
7 Correct 453 ms 39368 KB Output is correct
8 Correct 398 ms 39352 KB Output is correct
9 Correct 371 ms 39364 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 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 ms 444 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 448 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 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 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 ms 444 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 448 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 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 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 476 KB Output is correct
25 Correct 2 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 1 ms 348 KB Output is correct
2 Correct 109 ms 10244 KB Output is correct
3 Correct 158 ms 14260 KB Output is correct
4 Correct 367 ms 36532 KB Output is correct
5 Correct 242 ms 26260 KB Output is correct
6 Correct 444 ms 38772 KB Output is correct
7 Correct 453 ms 39368 KB Output is correct
8 Correct 398 ms 39352 KB Output is correct
9 Correct 371 ms 39364 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 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 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 0 ms 348 KB Output is correct
20 Correct 1 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 0 ms 444 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 448 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 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 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 476 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 335 ms 27032 KB Output is correct
37 Correct 452 ms 33488 KB Output is correct
38 Correct 552 ms 39412 KB Output is correct
39 Correct 505 ms 36276 KB Output is correct
40 Correct 549 ms 39352 KB Output is correct
41 Correct 600 ms 39360 KB Output is correct
42 Correct 428 ms 39352 KB Output is correct
43 Correct 438 ms 38252 KB Output is correct
44 Correct 421 ms 39376 KB Output is correct
45 Correct 398 ms 34112 KB Output is correct