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
#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;

vector<pair <long long, long long>> miny;
int d[500000];
unordered_set<int> ans;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        long long a, r;
        cin >> a >> r;
        miny.push_back({a, r});
    }
    for (int i = 0; i < n; i++)
    {
        d[i] = (1 << i);
        for (int j = i - 1; j >= 0; j--)
        {
            if(miny[j].first + miny[j].second >= miny[i].first)
            {
                d[i] |= d[j];
                break;
            } 
        }
    }
    for (int i = n - 1; i >= 0; i--)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (miny[j].first - miny[j].second <= miny[i].first)
            {
                d[i] |= d[j];
                break;
            }
        }
    }
    for (int b = 0; b < (1 << n); b++)
    {
        int det = 0;
        for (int i = 0; i < n; i++)
        {
            if (d[i]&b) det += (1 << i);
        }
        ans.insert(det);
    }
    cout << ans.size();
}