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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
#define mk make_pair
#define fi first
#define sz(x) x.size()
#define se second
#define pb push_back
#define VAR(v) #v << " = " << v << " "
#define debug if(0)
#define M_PI 3.14159265358979323846
typedef complex<long double> C;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> Matrix;
const int maxn = (int)5e6 + 9;
const int INF = (int)1e9 + 7;
int mod = (int)1e9 + 7;
bool vis[maxn];
ll pos[maxn];
ll range[maxn];
int n;
int occ[maxn];

void DFS(int v){
    vis[v] = true;
    for(int i = 0; i < n; i++)
        if(!vis[i] && abs(pos[v] - pos[i]) <= range[v])
            DFS(i);
}



int main(int argc, char* argv[])
{
    ios::sync_with_stdio(false);
    debug; else cin.tie(NULL), cout.tie(NULL);
    cin>>n;
    for(int i = 0; i < n; i++)
        cin>>pos[i]>>range[i];
    for(int sub = 0; sub < (1<<n); sub++)
    {
        for(int  i = 0; i < n; i++)
            vis[i] = false;
        for(int v = 0; v < n; v++)
            if(sub & (1<<v) && !vis[v])
                DFS(v);
        int mask = 0;
        for(int i = 0; i < n; i++)
            if(vis[i]) mask += (1<<i);
        occ[mask]++;
    }
    int ans = 0;
    for(int i = 0; i < (1<<n); i++)
        if(occ[i]) ans++;
    cout<<ans<<" ";
    return 0;
}