Submission #71339332

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}
using p = pair<ll, ll>;

int main(){
    int n; cin >> n;
    vll x(n), r(n); rep(i, n)cin >> x[i] >> r[i];
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    set<ll> st;
    rep(i, n){
        st.insert(x[i]+r[i]);
        st.insert(x[i]-r[i]);
    }
    map<ll, int> mp;
    int itr = 0;
    for(auto i : st){
        mp[i] = itr;
        itr++;
    }
    vector<p> vp(n);
    rep(i, n)vp[i] = {mp[x[i]-r[i]], mp[x[i]+r[i]]};
    sort(all(vp));
    mf_graph<ll> graph(n + itr+ 2);
    int l = n + itr + 1;
    rep(i, n){
        graph.add_edge(0, i+1, 1);
        graph.add_edge(i+1, n+1 + vp[i].first, 1);
        graph.add_edge(i+1, n+1 + vp[i].second, 1);
    }
    rep(i, itr)graph.add_edge(n+1+i, l, 1);
    cout << graph.flow(0, l) << endl;
    
    return 0;
}

Submission Info

Judge Result