Submission #848169

#	Time	Username	Problem	Language	Result	Execution time	Memory
848169		thangdz2k7	Advertisement 2 (JOI23_ho_t2)	C++17	0 / 100	0 ms	348 KiB

Main

#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second

using namespace std;

const int mod = 1e9 + 7;
const int N = 5e5 + 5;

int n;
ii sr[N];

void solve(){
    cin >> n;
    for (int i = 1, x, e; i <= n; ++ i){
        cin >> x >> e;
        sr[i].F = e - x;
        sr[i].S = e + x;
    }
    sort(sr + 1, sr + n + 1);

    int Max = -2e9;
    int ans = 0;
    for (int i = n; i >= 1; -- i){
        if (Max > sr[i].S){
            ++ ans;
            Max = sr[i].S;
        }
    }

    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    while (t --) solve();

    return 0;
}

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