Submission #745610

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
745610	2023-05-20 15:55:38	snpmrnhlol	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	438 ms	11212 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5;
struct numbers{
    int l,r;
};
numbers v[N];
numbers pr;
int main(){
    int n,i,x,e,ans;
    cin>>n;
    for(i = 0;i < n;i++){
        cin>>x>>e;
        v[i].l = x - e;
        v[i].r = x + e;
    }
    sort(v,v + n,[&](numbers a,numbers b){
        if(a.l == b.l)return a.r > b.r;
        return a.l < b.l;
    });
    ans = n;
    int maxx = -2e9;
    for(i = 0;i < n;i++){
        if(pr.l == v[i].l && v[i].r == pr.r){ans--;continue;}
        pr = v[i];
        //cout<<v[i].l<<' '<<v[i].r<<'\n';
        if(maxx >= v[i].r)ans--;
        maxx = max(maxx,v[i].r);
    }
    cout<<ans;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31