text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> a[2 * 100011];
void read() {
cin >> n;
for (__typeof(n) i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
}
int dp[2 * 100011][3];
void solve() {
sort(a + 1, a + n + 1);
a[0] = {-1000000007, 0};
a[n + 1] = {1000000007, 0};
int res = 0;
for (__typeof(n) i = 1; i <= n; i++) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
if (a[i - 1].first + a[i - 1].second < a[i].first)
dp[i][0] = max(dp[i][0], dp[i - 1][2]);
if (a[i - 1].first < a[i].first - a[i].second)
dp[i][1] = max(dp[i - 1][0] + 1, dp[i - 1][1] + 1);
if (a[i - 1].first + a[i - 1].second < a[i].first - a[i].second)
dp[i][1] = max(dp[i - 1][2] + 1, dp[i][1]);
dp[i][2] = max(dp[i - 1][0] + 1, dp[i][2]);
if (a[i - 1].first + a[i - 1].second < a[i].first)
dp[i][2] = max(dp[i - 1][2] + 1, dp[i][2]);
dp[i][2] = max(dp[i - 1][1] + 1, dp[i][2]);
res = max(res, dp[i][0]);
res = max(res, dp[i][1]);
res = max(res, dp[i][2]);
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
int t;
t = 1;
while (t--) {
read();
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, x[N], h[N], second[N], r[N], l[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
if (i) {
second[i] = second[i - 1];
r[i] = r[i - 1];
l[i] = l[i - 1];
if (x[i] > x[i - 1] + h[i - 1]) {
second[i] = max(second[i], r[i - 1]);
r[i] = max(r[i], r[i - 1] + 1);
if (x[i] - h[i] > x[i - 1] + h[i - 1]) l[i] = max(l[i], r[i - 1] + 1);
}
if (x[i] > x[i - 1]) {
int y = max(second[i - 1], l[i - 1]) + 1;
second[i] = max(second[i], y - 1);
r[i] = max(r[i], y);
if (x[i] - h[i] > x[i - 1]) l[i] = max(l[i], y);
}
} else {
second[0] = 1;
r[0] = 1;
l[0] = 1;
}
}
int ans = max(second[n - 1], r[n - 1]);
cout << max(ans, l[n - 1]) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
struct node {
int x, h;
} g[maxn];
int main() {
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i < n; i++) scanf("%d%d", &g[i].x, &g[i].h);
int Max = 1e9 + 10;
for (int i = 0; i < n; i++) {
if (i == n - 1 || i == 0) {
Max = g[i].x;
ans++;
continue;
}
if (g[i].x - g[i].h > Max)
ans++, Max = g[i].x;
else {
if (g[i].x + g[i].h < g[i + 1].x) {
ans++;
Max = g[i].x + g[i].h;
} else
Max = g[i].x;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long int i, n, j, c = 1;
scanf("%ld", &n);
long long int a[n][2];
for (i = 0; i < n; i++)
for (j = 0; j < 2; j++) scanf("%lld", &a[i][j]);
if (n == 1)
printf("%ld", c);
else {
for (i = 1; i < n - 1; i++) {
if (a[i][0] - a[i][1] > a[i - 1][0])
c++;
else if (a[i][0] + a[i][1] < a[i + 1][0]) {
a[i][0] = a[i][0] + a[i][1];
c++;
}
}
printf("%ld", c + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int xi[100005], hi[100005], i, j, nr, cnt, n;
int main() {
cin >> n;
if (n == 1 || n == 2) {
cout << n;
return 0;
} else {
nr = 2;
}
for (i = 1; i <= n; i++) {
cin >> xi[i] >> hi[i];
}
for (i = 2; i < n; i++) {
if (xi[i] - hi[i] > xi[i - 1]) {
nr++;
} else if (xi[i] + hi[i] < xi[i + 1]) {
nr++;
xi[i] += hi[i];
}
}
cout << nr;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > trees;
int N;
int memo[100010][3];
int max_area(int i, int last_point, int dir) {
if (i == N - 1) return 0;
int &ret = memo[i][dir];
if (ret != -1) {
return ret;
}
int c1 = -1;
if (trees[i].first - trees[i].second > last_point)
c1 = max_area(i + 1, trees[i].first, 0) + 1;
int c2 = -1;
if (trees[i].first + trees[i].second < trees[i + 1].first) {
c2 = max_area(i + 1, trees[i].first + trees[i].second, 1) + 1;
}
int c3 = -1;
c3 = max_area(i + 1, trees[i].first, 2);
return ret = max(c1, max(c2, c3));
}
int main() {
memset(memo, -1, sizeof(memo));
cin >> N;
int x, h;
for (int i = 0; i < N; i++) {
cin >> x >> h;
trees.push_back(make_pair(x, h));
}
sort(trees.begin(), trees.end());
if (N == 1)
cout << 1 << endl;
else
cout << max_area(1, trees[0].first, 0) + 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int x[n + 2], h[n + 2];
x[0] = numeric_limits<int>::min(), h[0] = 0;
x[n + 1] = numeric_limits<int>::max(), h[n + 1] = 0;
for (int i = 1; i < n + 1; i++) cin >> x[i] >> h[i];
int ans[n + 1][3];
ans[0][0] = ans[0][1] = ans[0][2] = 0;
for (int i = 1; i < n + 1; i++) {
ans[i][0] = 0;
ans[i][0] = max({ans[i - 1][1], ans[i - 1][0], ans[i][0]});
if (x[i - 1] + h[i - 1] < x[i]) ans[i][0] = max(ans[i][0], ans[i - 1][2]);
ans[i][1] = 0;
if (x[i - 1] + h[i - 1] < x[i] - h[i]) {
ans[i][1] = max(1 + ans[i - 1][2], ans[i][1]);
}
if (x[i - 1] < x[i] - h[i]) {
ans[i][1] = max(1 + max(ans[i - 1][1], ans[i - 1][0]), ans[i][1]);
}
ans[i][2] = 0;
if (x[i] + h[i] < x[i + 1]) {
ans[i][2] = max(1 + max({ans[i - 1][0], ans[i - 1][1], ans[i - 1][2]}),
ans[i][2]);
}
}
cout << max({ans[n][0], ans[n][1], ans[n][2]});
}
|
#include <bits/stdc++.h>
using namespace std;
bool csort(pair<int, int> a, pair<int, int> b) {
if (a.first < b.first)
return 1;
else if (a.first == b.first && a.second < b.second)
return 1;
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, nr = 0;
cin >> n;
vector<pair<int, int>> c(n);
for (i = 0; i < n; i++) cin >> c[i].first >> c[i].second;
sort(c.begin(), c.end(), csort);
if (n == 1)
nr = 1;
else
nr = 2;
for (i = 1; i < n - 1; i++) {
if (c[i - 1].first < c[i].first - c[i].second)
nr++;
else if (c[i + 1].first > c[i].first + c[i].second) {
c[i].first = c[i].first + c[i].second;
nr++;
}
}
cout << nr;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void showvec1d(vector<int> v) {
int n = v.size();
cout << "-------------start1dv--------------------"
<< "\n";
for (int i = 0; i < n; i++) cout << v[i] << " ";
cout << "\n";
cout << "--------------end1dv-------------------"
<< "\n";
}
void showvec2d(vector<vector<int> > v) {
int n = v.size();
cout << "--------------start2dv-----------------------\n";
for (int i = 0; i < n; i++) {
int sz = v[i].size();
for (int j = 0; j < sz; j++) cout << v[i][j] << " ";
cout << "\n";
}
cout << "-------------end2dv------------------"
<< "\n";
}
void solve() {
int n;
cin >> n;
int x, h;
cin >> x >> h;
int cnt = 1;
int prev = x + 1;
int psps;
for (int i = 1; i < n; i++) {
cin >> x;
if (prev > x) {
cnt--;
prev -= h;
}
cin >> h;
psps = x - prev;
if (psps >= h)
prev = x + 1;
else
prev = x + h + 1;
cnt++;
}
cout << cnt << "\n";
}
int main() {
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(0);
cout.sync_with_stdio(0);
int TC = 1;
for (int ZZ = 1; ZZ <= TC; ZZ++) {
clock_t start = clock();
solve();
clock_t end = clock();
cerr << "Time: " << (double)(end - start) / CLOCKS_PER_SEC << " seconds"
<< '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
long long temp;
if (y == 0) return 1;
temp = power(x, y / 2) % 1000000007;
if (y % 2 == 0)
return (temp % 1000000007 * temp % 1000000007) % 1000000007;
else
return ((x % 1000000007) *
((temp % 1000000007 * temp % 1000000007) % 1000000007)) %
1000000007;
}
bool comp(pair<long long, long long>& a, pair<long long, long long>& b) {
return (a.first < b.first);
}
void solve() {
long long n;
cin >> n;
vector<pair<long long, long long>> v;
set<long long> s;
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
v.push_back({a, b});
s.insert(a);
}
sort(v.begin(), v.end(), comp);
long long c = 0;
for (long long i = 0; i < n; i++) {
long long x = v[i].first;
long long h = v[i].second;
auto itr1 = s.lower_bound(x - h);
auto itr2 = s.lower_bound(x + h);
if (s.find(x - h) == s.end() && (i == 0 || *itr1 == v[i].first)) {
s.insert(x - h);
c++;
} else if (i == n - 1) {
c++;
} else if (s.find(x + h) == s.end() && *itr2 == v[i + 1].first) {
s.insert(x + h);
c++;
}
}
cout << c << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
t = 1;
for (long long i = 1; i <= t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > v;
int a, b, i;
for (i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, b});
}
int count = 2;
if (n == 1 || n == 2) {
cout << n << endl;
return 0;
}
int valid = v[0].first;
for (i = 1; i < n - 1; i++) {
int pre = (v[i].first - v[i].second);
int suf = v[i].first + v[i].second;
if (pre > valid) {
count++;
valid = v[i].first;
continue;
} else if (suf < v[i + 1].first) {
count++;
valid = suf;
} else {
valid = v[i].first;
continue;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, x = 2, p;
cin >> n;
long long a[n], h[n];
for (i = 0; i < n; i++) cin >> a[i] >> h[i];
if (n == 1) x = 1;
p = a[0];
for (i = 1; i < n - 1; i++) {
if (h[i] < a[i] - p) {
p = a[i];
x++;
} else if (h[i] < a[i + 1] - a[i]) {
p = a[i] + h[i];
x++;
} else
p = a[i];
}
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long x[n];
long long h[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
cin >> h[i];
}
long long prev = -INT_MAX;
long long ans = 0;
for (int i = 0; i < n; i++) {
if (x[i] - h[i] > prev) {
ans++;
prev = x[i];
} else if (x[i] + h[i] < x[i + 1]) {
ans++;
prev = x[i] + h[i];
} else {
prev = x[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int pw(long long int b, long long int p) {
if (!p) return 1;
long long int sq = pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
long long int gcd(long long int a, long long int b) {
return (b == 0 ? a : gcd(b, a % b));
}
long long int lcm(long long int a, long long int b) {
return ((a * b) / gcd(a, b));
}
bool cmp(double a, double b) { return abs(a - b) < 1e-9; }
bool isint(double a) { return cmp(a, round(a)); }
const double PI = acos(-1);
long long int OO = 1e18 + 8;
int oo = 1e9 + 9;
int dx[6] = {1, -1, 0, 0, 0, 0}, dy[6] = {0, 0, 1, -1, 0, 0},
dz[6] = {0, 0, 0, 0, 1, -1};
vector<pair<long long int, long long int>> trees;
long long int dp[100005][4];
long long int n, t, h;
long long int maximum(long long int idx = 0, long long int type = 3,
long long int maxiX = -OO) {
if (idx == n) return 0;
long long int &ret = dp[idx][type];
if (~ret) return ret;
ret = 0;
ret = maximum(idx + 1, 0, trees[idx].first);
if (trees[idx].first - trees[idx].second > maxiX)
ret = max(ret, maximum(idx + 1, 1, trees[idx].first) + 1);
if (idx == n - 1 ||
trees[idx].first + trees[idx].second < trees[idx + 1].first)
ret =
max(ret, maximum(idx + 1, 2, trees[idx].first + trees[idx].second) + 1);
return ret;
}
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
;
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++) cin >> t >> h, trees.push_back({t, h});
cout << maximum() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n], b[n];
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
long long stop = a[0];
int ans = 2;
if (n == 1) {
cout << "1";
return 0;
}
for (int i = 1; i < n - 1; i++) {
int y = a[i];
if (y - b[i] > stop) {
ans++;
stop = a[i];
} else if (y + b[i] < a[i + 1]) {
stop = a[i] + y;
ans++;
} else
stop = a[i];
}
int ans1 = 2;
int stop1 = a[n - 1];
for (int i = n - 2; i >= 1; i--) {
int y = a[i];
if (y + b[i] < stop1) {
++ans1;
stop1 = a[i];
} else if (y - b[i] > a[i - 1]) {
stop1 = y - b[i];
++ans1;
} else
stop1 = a[i];
}
cout << max(ans, ans1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
const ll INF = 1e18;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vl xi(n), hi(n);
for (int i = (0); i < (n); ++i) cin >> xi[i] >> hi[i];
int ans = 1;
int prev = 0;
for (int i = (1); i < (n - 1); ++i) {
if (prev == 0) {
if (xi[i] - hi[i] > xi[i - 1])
ans++;
else if (xi[i] + hi[i] < xi[i + 1]) {
prev = 1;
ans++;
}
} else if (prev == 1) {
if (xi[i] - hi[i] > xi[i - 1] + hi[i - 1]) {
prev = 0;
ans++;
} else if (xi[i] + hi[i] < xi[i + 1])
ans++;
else
prev = 0;
}
}
if (n >= 2) ans++;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int x[100050], h[100050];
int dp[100050][2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x[i] >> h[i];
}
x[0] = -1000000001;
x[n + 1] = 2000000001;
for (int i = 1; i <= n; i++) {
if (x[i + 1] - x[i] > h[i]) dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
if (x[i] - x[i - 1] > h[i - 1] + h[i]) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
} else if (x[i] - x[i - 1] > h[i]) {
dp[i][0] = max(dp[i - 1][0] + 1, dp[i][0]);
}
dp[i][0] = max(max(dp[i - 1][0], dp[i][0]), dp[i - 1][1]);
}
cout << max(dp[n][0], dp[n][1]) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MAXN = (long long)1e5 + 10;
vector<long long> x(MAXN);
vector<long long> h(MAXN);
long long n;
int main() {
cout << setprecision(20);
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> h[i];
}
long long ans = 0;
long long r = (long long)-1e10;
for (int i = 0; i < n; ++i) {
if (x[i] - h[i] > r) {
++ans;
r = x[i];
continue;
}
if (i == n - 1 || x[i + 1] > x[i] + h[i]) {
r = x[i] + h[i];
++ans;
continue;
}
r = x[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, x[100000], h[100000], a[100000], b[100000], c[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> x[i] >> h[i];
a[0] = 1;
b[0] = 0;
c[0] = (x[0] + h[0] < x[1] ? 1 : 0);
for (int i = 1; i < n; i++) {
if (x[i] - h[i] > x[i - 1] + h[i - 1])
a[i] = max(a[i], max(a[i - 1], max(b[i - 1], c[i - 1])) + 1);
else if (x[i] - h[i] > x[i - 1])
a[i] = max(a[i], max(a[i - 1], b[i - 1]) + 1);
else
a[i] = max(a[i - 1], max(b[i - 1], c[i - 1]));
b[i] = c[i] = max(a[i - 1], max(b[i - 1], c[i - 1]));
if (i != n - 1 && x[i] + h[i] < x[i + 1]) c[i]++;
if (i == n - 1) c[i]++;
}
cout << max(a[n - 1], max(b[n - 1], c[n - 1]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct {
int x;
int h;
} point;
int main() {
int n;
cin >> n;
list<point> tree;
point x;
for (int i = 0; i < n; i++) {
cin >> x.x >> x.h;
tree.push_back(x);
}
x = tree.front();
x.x = x.x - x.h;
x.h = 0;
tree.push_front(x);
int count = 1;
list<point>::iterator i = tree.begin(), j, k;
i++;
j = i;
i++;
k = i;
k++;
for (; k != tree.end(); i++, j++, k++) {
if ((*i).h > 0) {
if (((*i).x - (*i).h) > (*j).x) {
count++;
x = *i;
x.x = x.x - x.h;
x.h = 0;
tree.insert(i, x);
j++;
} else if (((*i).x + (*i).h) < (*k).x) {
count++;
x = *i;
x.x = x.x + x.h;
x.h = 0;
tree.insert(k, x);
j++;
i++;
}
}
}
if (n > 1) count++;
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int location[1000005], height[1000004];
int main() {
int trees;
cin >> trees;
for (int i = 0; i < trees; i++) cin >> location[i] >> height[i];
if (trees <= 2)
cout << trees;
else {
int ans = 2, flag = 0, m = 0;
for (int i = 1; i < trees - 1; i++) {
m = 1;
if (location[i] - height[i] > location[i - 1]) {
m = 0;
ans++;
if (flag &&
location[i - 1] + height[i - 1] >= location[i] - height[i]) {
ans--;
m = 1;
}
flag = 0;
}
if (m && location[i] + height[i] < location[i + 1]) {
flag = 1;
ans++;
} else
flag = 0;
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > X;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x, h;
cin >> x >> h;
X.push_back(make_pair(x, h));
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
sort(X.begin(), X.end());
int cnt = 1;
for (int i = 1; i < n - 1; i++) {
if (X[i].first - X[i].second > X[i - 1].first) {
cnt++;
continue;
}
if (X[i].first + X[i].second < X[i + 1].first) {
cnt++;
X[i].first = X[i].first + X[i].second;
continue;
}
}
cnt++;
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long long, long long> > v;
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
int counter = 0;
for (int i = 0; i < n; i++) {
if (i == 0 || i == n - 1)
counter++;
else {
if (i - 1 >= 0 && (v[i].first - v[i].second) > v[i - 1].first)
counter++;
else if (i + 1 < n && (v[i].first + v[i].second) < v[i + 1].first) {
counter++;
v[i].first = v[i].first + v[i].second;
}
}
}
cout << counter << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][2];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
int ans = 0;
if (n >= 2)
ans = 2;
else if (n == 1)
ans = 1;
for (int i = 1; i < n - 1; i++) {
if (a[i][0] - a[i][1] > a[i - 1][0])
ans += 1;
else if (a[i][0] + a[i][1] < a[i + 1][0]) {
a[i][0] = a[i][0] + a[i][1];
ans += 1;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n), h(n);
for (long long i = 0; i < n; i++) cin >> v[i] >> h[i];
if (n <= 2) {
cout << n << endl;
return 0;
}
long long k = 2, a = v[0];
for (long long i = 1; i < n - 1; i++) {
if ((v[i] - h[i]) > a) {
k++;
a = v[i];
} else if ((v[i] + h[i]) < v[i + 1]) {
k++;
a = v[i] + h[i];
} else
a = v[i];
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<pair<int, int> > arr;
pair<int, int> tmpp;
for (int i = 0; i < n; i++) {
cin >> tmpp.first >> tmpp.second;
arr.push_back(tmpp);
}
if (n == 1) {
cout << "1" << '\n';
return;
}
int ans = 2;
int last = arr[0].first;
int x = 0, h = 0, nx = 0;
for (int i = 1; i < n - 1; i++) {
x = arr[i].first;
h = arr[i].second;
nx = arr[i + 1].first;
if (x - last > h)
ans++, last = x;
else if (nx - x > h)
ans++, last = x + h;
else
last = x;
}
cout << ans << '\n';
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001], h[100001], ans = 2;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &h[i]);
for (int i = 2; i < n; i++) {
if (a[i] - h[i] > a[i - 1])
ans++;
else if (a[i] + h[i] < a[i + 1])
ans++, a[i] += h[i];
}
if (n == 1) return printf("1"), 0;
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err() {
cout << "NO\n";
exit(0);
}
int main() {
int n, i, j, a;
cin >> n;
if (n == 1 || n == 2) {
cout << n;
return 0;
}
int arr[n], ht[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
cin >> ht[i];
}
int dp[n][3];
dp[0][0] = 1;
dp[0][1] = -1e9;
dp[0][2] = -1e9;
for (i = 1; i < n - 1; i++) {
dp[i][1] = max(max(dp[i - 1][0], dp[i - 1][1]), dp[i - 1][2]);
if (arr[i + 1] > arr[i] + ht[i]) {
dp[i][2] = dp[i][1] + 1;
} else
dp[i][2] = -1e9;
dp[i][0] = -1e9;
if (arr[i - 1] < arr[i] - ht[i]) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][0]) + 1;
if ((arr[i - 1] + ht[i - 1]) < arr[i] - ht[i]) {
dp[i][0] = max(dp[i - 1][2] + 1, dp[i][0]);
}
}
}
int ans = max(max(dp[n - 2][0], dp[n - 2][1]), dp[n - 2][2]);
ans++;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int pos[100005];
pair<int, int> tree[100005];
bool func(pair<int, int> x, pair<int, int> y) { return (x.first) < (y.first); }
int main() {
int n;
for (int i = 1; i < 100005; i++) {
pos[i] = 2e9 + 1000;
}
pos[0] = -2e9;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &tree[i].first, &tree[i].second);
}
sort(tree, tree + n, func);
int mx = 0, g;
for (int i = 0; i < n; i++) {
if (i != 0 && tree[i].first - tree[i].second <= tree[i - 1].first) {
} else {
g = lower_bound(pos, pos + n, tree[i].first - tree[i].second) - pos;
pos[g] = min(pos[g], tree[i].first);
mx = max(mx, g);
}
if (i != n - 1 && tree[i].first + tree[i].second >= tree[i + 1].first) {
} else {
g = lower_bound(pos, pos + n, tree[i].first) - pos;
pos[g] = min(pos[g], tree[i].first + tree[i].second);
mx = max(mx, g);
}
}
printf("%d", mx);
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
long long X[110000], H[110000];
long long lowbond = 0;
int main() {
scanf("%d", &N);
int ans = 0;
for (int i = 0; i < N; i++) {
scanf("%I64d %I64d", &X[i], &H[i]);
}
for (int i = 0; i < N; i++) {
if (i == 0 || i == N - 1)
ans++;
else {
if ((X[i] - H[i] > X[i - 1]) && (X[i] - H[i] > lowbond)) {
ans++;
} else if (X[i] + H[i] < X[i + 1]) {
ans++;
lowbond = X[i] + H[i];
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
vector<long long int> x(n), h(n);
for (long long int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
vector<pair<long long int, long long int> > a(n);
a[0].first = 99999999999;
a[n - 1].second = 99999999999;
for (long long int i = 0; i < n - 1; i++) {
a[i].second = x[i + 1] - x[i] - 1;
a[i + 1].first = a[i].second;
}
long long int c = 0;
for (long long int i = 0; i < n - 1; i++) {
if (a[i].first >= h[i]) {
c++;
} else if (a[i].second >= h[i]) {
a[i].second -= h[i];
a[i + 1].first -= h[i];
c++;
}
}
cout << c + 1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int x, y, i, j, k;
int n;
cin >> n;
pair<int, int> a[n];
for (i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
a[0].second = a[0].first - a[0].second;
a[n - 1].second = a[n - 1].first - a[n - 1].second;
k = 0;
int sum;
if (n == 1) {
sum = 1;
} else {
sum = 2;
}
for (i = 1; i < n - 1; i++) {
if (a[i].first - a[i - 1].first > a[i].second &&
a[i].first - a[i - 1].second > a[i].second) {
a[i].second = a[i].first - a[i].second;
sum += 1;
} else if (a[i + 1].first - a[i].first > a[i].second) {
a[i].second = a[i].first + a[i].second;
sum += 1;
} else {
sum += 0;
a[i].second = a[i].first;
}
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, x[100000], h[100000], count = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x[i], &h[i]);
}
int position = -1000000000;
bool side = false;
for (int i = 0; i < n; i++) {
if (side) {
if (position < x[i] - h[i]) {
count++;
side = false;
} else if (h[i] < x[i + 1] - x[i] || i == n - 1) {
count++;
side = true;
position = x[i] + h[i];
} else
side = false;
} else if (!side) {
if (h[i] < x[i] - x[i - 1] || i == 0) {
count++;
} else if (h[i] < x[i + 1] - x[i] || i == n - 1) {
count++;
side = true;
position = x[i] + h[i];
}
}
}
printf("%d", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
int h[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
if (n == 1) {
cout << 1 << "\n";
} else if (n == 2) {
cout << 2 << "\n";
} else {
int fall[n];
fall[0] = x[0];
fall[n - 1] = x[n - 1];
int cnt = 2;
for (int i = 1; i < n - 1; i++) {
if (h[i] < (x[i] - fall[i - 1])) {
fall[i] = x[i];
cnt++;
} else if (h[i] < x[i + 1] - x[i]) {
fall[i] = x[i] + h[i];
cnt++;
} else {
fall[i] = x[i];
}
}
cout << cnt << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const long long INF = 2e18;
void print(int a[], int n) {
for (int i = 0; i < n; i++) cout << a[i] << " ";
cout << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while (tc--) {
int n;
cin >> n;
int x[n], h[n];
for (int i = 0; i < (n); i++) cin >> x[i] >> h[i];
int ans = 0;
if (n == 1)
ans = 1;
else
ans = 2;
int right = 0;
for (int i = 1; i <= (n - 2); i++) {
int tem = x[i] - h[i];
if (!((tem <= x[i - 1]) or tem <= right)) {
ans++;
right = x[i];
} else {
tem = x[i] + h[i];
if (tem < x[i + 1]) ans++, right = tem;
}
}
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n;
void solve() {
cin >> n;
long long int x[n], h[n];
for (long long int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
long long int curr[n];
memset(curr, 0, sizeof(curr));
long long int ans = min(2ll, n);
curr[0] = -1;
for (long long int i = 1; i < n - 1; i++) {
if (curr[i - 1] != 1) {
if (x[i] - h[i] > x[i - 1]) {
ans++;
curr[i] = -1;
} else if (x[i] + h[i] < x[i + 1]) {
ans++;
curr[i] = 1;
}
} else if (x[i - 1] + h[i - 1] < x[i] - h[i]) {
ans++;
curr[i] = -1;
} else if (x[i] + h[i] < x[i + 1]) {
ans++;
curr[i] = 1;
}
}
cout << ans;
}
int32_t main() {
{
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
};
long long int t = 1;
while (t--) {
solve();
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> c;
long long int n;
long long int dp[100004][3];
long long int max1(int cu, int pos) {
if (cu == n - 1) return 1;
if (dp[cu][pos] > -1) return dp[cu][pos];
long long int opt1 = INT_MIN;
long long int opt2 = INT_MIN;
long long int opt3 = INT_MIN;
if (pos == 0 || pos == 2) {
if (c[cu] - h[cu] > c[cu - 1]) opt1 = 1 + max1(cu + 1, 0);
if (c[cu] + h[cu] < c[cu + 1]) opt2 = 1 + max1(cu + 1, 1);
opt3 = max1(cu + 1, 2);
}
if (pos == 1) {
if (c[cu] - h[cu] > c[cu - 1] + h[cu - 1]) opt1 = 1 + max1(cu + 1, 0);
if (c[cu] + h[cu] < c[cu + 1]) opt2 = 1 + max1(cu + 1, 1);
opt3 = max1(cu + 1, 2);
}
return dp[cu][pos] = max(opt1, max(opt2, opt3));
}
int main() {
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
long long int a;
long long int b;
cin >> a;
cin >> b;
c.push_back(a);
h.push_back(b);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
long long int opt1 = INT_MIN;
long long int opt2 = INT_MIN;
if (c[0] + h[0] < c[1]) opt1 = 1 + max1(1, 1);
opt2 = 1 + max1(1, 0);
long long int ans = max(opt1, max(opt2, max1(1, 2)));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getMaxTrees(int n, vector<int> points, vector<int> heights, vector<int> t) {
if (n == 0) {
return 1;
}
int left = 0;
int right = 0;
int mid = 0;
if (heights[n] + points[n] < points[n + 1]) {
if (t[n + 1]) {
if (heights[n] + points[n] < t[n + 1]) {
t[n] = heights[n] + points[n];
right = getMaxTrees(n - 1, points, heights, t);
}
} else {
t[n] = heights[n] + points[n];
right = getMaxTrees(n - 1, points, heights, t);
}
}
if (points[n] - heights[n] > points[n - 1]) {
if (t[n - 1]) {
if (points[n] - heights[n] > t[n - 1]) {
t[n] = points[n] - heights[n];
left = getMaxTrees(n - 1, points, heights, t);
}
} else {
t[n] = points[n] - heights[n];
left = getMaxTrees(n - 1, points, heights, t);
}
}
mid = getMaxTrees(n - 1, points, heights, t);
if (left || right) {
return 1 + max(max(left, right), mid);
}
return mid;
}
void solve() {
long long n;
cin >> n;
vector<long long> points(n + 1);
vector<long long> heights(n);
vector<long long> t(n + 1, 0);
for (long long i = 0; i < n; i++) {
cin >> points[i] >> heights[i];
}
if (n <= 2) {
cout << n << endl;
return;
}
long long trees = 2;
for (long long i = 1; i < n - 1; i++) {
if (points[i] - heights[i] > (t[i - 1] > 0 ? t[i - 1] : points[i - 1])) {
trees++;
} else {
if (points[i] + heights[i] < points[i + 1]) {
t[i] = points[i] + heights[i];
trees++;
}
}
}
cout << trees << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int ultIzq, ultDer;
pair<int, int> arr[400005];
int cont = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &arr[i].first, &arr[i].second);
}
cont = 2;
if (n == 1) {
cout << 1 << endl;
return 0;
} else if (n == 2) {
cout << 2 << endl;
return 0;
} else {
ultIzq = arr[0].first;
ultDer = arr[n - 1].first;
for (int i = 1; i < n - 1; i++) {
if (arr[i].first - arr[i].second > ultIzq) {
cont++;
ultIzq = arr[i].first;
} else {
if (arr[i].first + arr[i].second < arr[i + 1].first) {
cont++;
ultIzq = arr[i].first + arr[i].second;
} else {
ultIzq = arr[i].first;
}
}
}
}
cout << cont << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i) {
int x, h;
cin >> x >> h;
v.push_back(make_pair(x, h));
}
int res = min(2, n);
for (int i = 1; i < n - 1; ++i) {
if (v[i - 1].first < (v[i].first - v[i].second)) {
res++;
} else if (v[i].first + v[i].second < v[i + 1].first) {
v[i].first += v[i].second;
res++;
}
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void P(int x) { cout << x << '\n'; }
void PP(int a, int b) { cout << a << " " << b << '\n'; }
void PV(vector<int> v) {
int n = (v).size();
for (auto& i : (v)) cout << i << " ";
cout << '\n';
}
void PPV(vector<pair<int, int> > v) {
int n = (v).size();
for (auto& i : (v)) cout << i.first << " " << i.second << '\n';
}
const long long INF = (1LL << 60);
const int MOD = 1e9 + 7;
const int nax = 2e5 + 5;
const double p = 3.14159265359;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<int, int> > t(n);
for (int i = 0; i < n; ++i) {
cin >> t[i].first >> t[i].second;
}
vector<vector<int> > dp(2, vector<int>(n, 0));
dp[0][0] = 1;
dp[1][0] = 0;
for (int i = 1; i < n; ++i) {
dp[0][i] = max({dp[0][i - 1], dp[1][i - 1], dp[0][i]});
if (t[i].first - t[i].second > t[i - 1].first) {
dp[0][i] = max(dp[0][i], dp[0][i - 1] + 1);
}
if (t[i].first - t[i].second > t[i - 1].first + t[i - 1].second) {
dp[0][i] = max(dp[0][i], dp[1][i - 1] + 1);
}
if (i == n - 1 || t[i].first + t[i].second < t[i + 1].first) {
dp[1][i] = max(dp[1][i], max(dp[0][i - 1], dp[1][i - 1]) + 1);
}
}
P(max(dp[0][n - 1], dp[1][n - 1]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, x, h;
cin >> n;
if (n <= 2) {
cout << n;
return 0;
}
vector<pair<ll, ll>> v(n + 2);
for (int i = 1; i <= n; ++i) cin >> v[i].first >> v[i].second;
v[0] = make_pair(INT_MIN, 0);
v[n + 1] = make_pair(INT_MAX, 0);
sort(begin(v), end(v));
vector<ll> vl(n + 2), vr(n + 2);
for (int i = 1; i <= n; ++i) {
if (v[i].first - v[i].second > v[i - 1].first) {
vl[i] = vl[i - 1] + 1;
if (v[i].first - v[i].second > v[i - 1].first + v[i - 1].second)
vl[i] = max(vl[i], vr[i - 1] + 1);
else
vl[i] = max(vl[i], vr[i - 1]);
} else
vl[i] = max(vl[i - 1], vr[i - 1]);
if (v[i].first + v[i].second < v[i + 1].first)
vr[i] = max(vl[i - 1], vr[i - 1]) + 1;
else
vr[i] = max(vl[i - 1], vr[i - 1]);
}
cout << max(vl[n], vr[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5;
int n, x, y, cnt = 2, us[N];
pair<int, int> a[N];
int main() {
cin >> n;
if (n == 1) {
cout << cnt - 1;
return 0;
}
for (int i = 1; i <= n; i++) {
cin >> x >> y;
a[i] = {x, y};
}
for (int i = 2; i < n; i++) {
x = a[i].first, y = a[i].second;
if (x - a[i - 1].first <= y && abs(x - a[i + 1].first) > y)
a[i].first += y, cnt++;
else if (x - a[i - 1].first > y && !us[i - 1])
cnt++;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int x[100005], h[100005], f[100005];
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
if (n == 1 || n == 2) {
cout << n << endl;
return 0;
}
int cnt = 0;
cnt = 1;
f[0] = 1;
for (i = 1; i < n - 1; i++) {
if (f[i - 1] != 2 && x[i] - h[i] > x[i - 1]) {
cnt += 1;
f[i] = 1;
} else if (f[i - 1] == 2 && x[i] - h[i] > x[i - 1] + h[i - 1]) {
cnt += 1;
f[i] = 1;
} else if (x[i] + h[i] < x[i + 1]) {
cnt += 1;
f[i] = 2;
}
}
cnt += 1;
f[n - 1] = 2;
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k, i, x = 2;
cin >> n;
long long a[n][2], b[n][2];
for (i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
if (n < 3) {
cout << n << "\n";
return;
} else {
for (i = 1; i < n - 1; i++) {
b[i][0] = a[i][0] - a[i][1];
b[i][1] = a[i][0] + a[i][1];
}
for (i = 1; i < n - 1; i++) {
if (b[i][0] > a[i - 1][0])
x++;
else if (b[i][1] < a[i + 1][0]) {
a[i][0] += a[i][1];
x++;
}
}
}
cout << x << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
for (long long i = 1; i <= t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 1e5 + 5;
const int inf = 2e9 + 5;
int dp[MAXN][2];
std::pair<int, int> ar[MAXN];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%d %d", &ar[i].first, &ar[i].second);
std::sort(ar + 1, ar + 1 + N);
ar[0].first = -inf;
ar[N + 1].first = inf;
for (int i = N; i >= 1; i--) {
for (int j = 0; j < 2; j++) {
int &ret = dp[i][j];
ret = dp[i + 1][0];
if (ar[i].first + ar[i].second < ar[i + 1].first)
ret = std::max(ret, dp[i + 1][1] + 1);
if (j) {
if (ar[i - 1].first + ar[i - 1].second + ar[i].second < ar[i].first)
ret = std::max(ret, dp[i + 1][0] + 1);
} else {
if (ar[i - 1].first + ar[i].second < ar[i].first)
ret = std::max(ret, dp[i + 1][0] + 1);
}
}
}
printf("%d\n", dp[1][0]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct Tree {
int pos, height;
};
Tree a[N];
int dp[N][3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].pos >> a[i].height;
}
dp[1][0] = 0;
dp[1][1] = 1;
if (a[1].pos + a[1].height < a[2].pos)
dp[1][2] = 1;
else
dp[1][2] = 0;
for (int i = 2; i <= n; i++) {
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
dp[i][1] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
dp[i][2] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
if (a[i].pos - a[i].height > a[i - 1].pos)
dp[i][1] = 1 + max(dp[i - 1][0], dp[i - 1][1]);
if (a[i].pos - a[i].height > a[i - 1].pos + a[i - 1].height)
dp[i][1] = max(dp[i][1], 1 + dp[i - 1][2]);
if (i < n) {
if (a[i].pos + a[i].height < a[i + 1].pos)
dp[i][2] = 1 + max(dp[i - 1][2], max(dp[i - 1][0], dp[i - 1][1]));
} else {
dp[i][2]++;
}
}
cout << max(dp[n][2], max(dp[n][0], dp[n][1]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<pair<long, long>> a;
long x, h;
a.emplace_back(0, 0);
for (int i = 0; i < n; i++) {
cin >> x >> h;
a.emplace_back(x, h);
}
sort(a.begin(), a.end());
vector<pair<long, long>> cut_left(n + 1);
vector<pair<long, long>> cut_right(n + 1);
vector<pair<long, long>> not_cut(n + 1);
cut_left[0] = {0, -1e9};
cut_right[0] = {0, -1e9};
not_cut[0] = {0, -1e9};
for (int i = 1; i < n; i++) {
x = a[i].first;
h = a[i].second;
long lastep, lastc;
lastc = cut_left[i - 1].first;
lastep = cut_left[i - 1].second;
if (lastep < x - h) {
cut_left[i] = {lastc + 1, x};
} else {
cut_left[i] = {0, x};
}
lastc = cut_right[i - 1].first;
lastep = cut_right[i - 1].second;
if (lastep < x - h) {
if (lastc + 1 > cut_left[i].first) {
cut_left[i] = {lastc + 1, x};
}
}
lastc = not_cut[i - 1].first;
lastep = not_cut[i - 1].second;
if (lastep < x - h) {
if (lastc + 1 > cut_left[i].first) {
cut_left[i] = {lastc + 1, x};
}
}
lastc = cut_left[i - 1].first;
lastep = cut_left[i - 1].second;
if (lastep < x) {
not_cut[i] = {lastc, x};
} else {
not_cut[i] = {0, x};
}
lastc = cut_right[i - 1].first;
lastep = cut_right[i - 1].second;
if (lastep < x) {
if (lastc > not_cut[i].first) {
not_cut[i] = {lastc, x};
}
}
lastc = not_cut[i - 1].first;
lastep = not_cut[i - 1].second;
if (lastep < x) {
if (lastc > cut_left[i].first) {
cut_left[i] = {lastc, x};
}
}
lastc = cut_left[i - 1].first;
lastep = cut_left[i - 1].second;
long nextx = a[i + 1].first;
if (lastep < x and x + h < nextx) {
cut_right[i] = {lastc + 1, x + h};
} else {
cut_right[i] = {0, x};
}
lastc = cut_right[i - 1].first;
lastep = cut_right[i - 1].second;
if (lastep < x and x + h < nextx) {
if (lastc + 1 > cut_right[i].first) {
cut_right[i] = {lastc + 1, x + h};
}
}
lastc = not_cut[i - 1].first;
lastep = not_cut[i - 1].second;
if (lastep < x and x + h < nextx) {
if (lastc + 1 > cut_right[i].first) {
cut_right[i] = {lastc + 1, x + h};
}
}
}
long ans = max(cut_left[n - 1].first,
max(cut_right[n - 1].first, not_cut[n - 1].first));
cout << ans + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
pair<int, int> p[maxn];
int dp[maxn][3];
int n;
void start() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void init() { memset(dp, 0, sizeof(dp)); }
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
}
void solve() {
sort(p, p + n);
for (int i = 1; i <= n; i++) {
dp[i][1] = max(dp[i - 1][1], max(dp[i - 1][0], dp[i - 1][2]));
if (i == 1 || p[i].first - p[i - 1].first > p[i].second)
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
if (p[i].first - p[i - 1].first > p[i].second + p[i - 1].second)
dp[i][0] = max(dp[i - 1][2] + 1, dp[i][0]);
if (i == n || p[i].first + p[i].second < p[i + 1].first)
dp[i][2] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2])) + 1;
}
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << endl;
}
void AC() {
start();
init();
read();
solve();
}
int main() {
AC();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long inf = 0x3f;
int dp[maxn][3];
struct Tree {
long long x, h;
} arr[maxn];
int transfer(int a, int b, int id) {
int v = 0;
if (arr[id].x < a) {
v = max(dp[id][0], dp[id][1]);
}
if (arr[id].x + arr[id].h < a) {
v = max(v, dp[id][2]);
}
return v;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int u, v;
scanf("%d%d", &u, &v);
arr[i].x = u, arr[i].h = v;
}
arr[0].x = arr[0].h = -inf;
for (int i = 1; i <= n; i++) {
dp[i][0] = transfer(arr[i].x, arr[i].x, i - 1);
dp[i][1] = transfer(arr[i].x - arr[i].h, arr[i].x, i - 1) + 1;
dp[i][2] = transfer(arr[i].x, arr[i].x + arr[i].h, i - 1) + 1;
}
printf("%d\n", max(dp[n][0], max(dp[n][1], dp[n][2])));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);
struct Tree {
int x, h;
} tree[maxn];
int dp[maxn][5];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &tree[i].x, &tree[i].h);
}
tree[n].x = 2000000010, tree[n].h = 2000000010;
dp[0][0] = 1;
dp[0][2] = 0;
if (tree[0].x + tree[0].h < tree[1].x)
dp[0][1] = 1;
else
dp[0][1] = 0;
for (int i = 1; i < n; i++) {
dp[i][2] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
if (tree[i].x + tree[i].h < tree[i + 1].x) {
dp[i][1] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2])) + 1;
}
if (tree[i].x - tree[i].h <= tree[i - 1].x) {
dp[i][0] = dp[i][2];
} else if (tree[i].x - tree[i].h <= tree[i - 1].x + tree[i - 1].h) {
dp[i][0] = max(dp[i - 1][1], max(dp[i - 1][0] + 1, dp[i - 1][2] + 1));
} else {
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2])) + 1;
}
}
int ans = max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
template <class T, class... U>
void pr(T&& a, U&&... b) {
cout << forward<T>(a);
(int[]){(cout << " " << forward<U>(b), 0)...};
cout << "\n";
}
template <class T, class... U>
void re(T&& a, U&&... b) {
cin >> forward<T>(a);
(int[]){(cin >> forward<U>(b), 0)...};
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
void solve() {
int n;
int dp[100001][3];
vector<pair<long long, long long>> trees;
re(n);
for (int i = 0; i < n; i++) {
long long x, h;
re(x, h);
trees.push_back({x, h});
}
memset(dp, 0, sizeof(dp));
dp[0][1] = 1;
dp[0][2] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
long long pre_x, pre_h;
pre_x = trees[i - 1].first;
pre_h = trees[i - 1].second;
int c = (trees[i].first <= pre_x + pre_h) ? 0 : dp[i - 1][2];
dp[i][0] = max(max(dp[i - 1][0], dp[i - 1][1]), c);
dp[i][2] = dp[i][0] + 1;
int a = (trees[i].first - trees[i].second <= pre_h + pre_x)
? 0
: dp[i - 1][2];
if (trees[i].first - trees[i].second <= pre_x)
dp[i][1] = 0;
else {
dp[i][1] = max(max(dp[i - 1][0], dp[i - 1][1]), a) + 1;
}
}
}
pr(max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]));
}
|
#include <bits/stdc++.h>
long long x[100005], h[100005];
int main() {
int n, i;
scanf("%d", &n);
if (n == 1) {
for (i = 1; i <= n; i++) {
scanf("%I64d%I64d", &x[i], &h[i]);
}
printf("1\n");
return 0;
} else {
int ans = 2;
for (i = 1; i <= n; i++) {
scanf("%I64d%I64d", &x[i], &h[i]);
}
long long pos = x[1];
for (i = 2; i < n; i++) {
if (x[i] - h[i] > pos) {
ans++;
pos = x[i];
} else if (x[i] + h[i] < x[i + 1]) {
ans++;
pos = x[i] + h[i];
} else
pos = x[i];
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
int ans = 2;
for (int i = 1; i < n - 1; i++) {
if (v[i].second < v[i].first - v[i - 1].first)
ans++;
else if (v[i].second < v[i + 1].first - v[i].first) {
ans++;
v[i].first += v[i].second;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x[1000001], h[1000001];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
if (n == 1) {
cout << 1;
return 0;
}
int prev = x[0];
int ans = 2;
for (int i = 1; i < n - 1; i++) {
if (prev < x[i] - h[i]) {
ans++;
prev = x[i];
} else if (x[i] + h[i] < x[i + 1]) {
ans++;
prev = x[i] + h[i];
} else {
prev = x[i];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct T {
long long int a, b;
} ar[1000000];
int main() {
long long int i, j, k, l, t, cs = 1, r = 1, s, m, n, a, b, c, d, e, f, g, h,
u, v;
scanf("%I64d", &n);
for (i = 0; i < n; i++) {
scanf("%I64d %I64d", &ar[i].a, &ar[i].b);
}
long long int ans = 0;
a = -100000000000000;
ar[n].a = 1000000000000000000;
for (i = 0; i < n; i++) {
if (a < ar[i].a - ar[i].b) {
ans++;
a = ar[i].a;
} else if (ar[i].a + ar[i].b < ar[i + 1].a) {
ans++;
a = ar[i].a + ar[i].b;
}
a = max(a, ar[i].a);
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > a(100005);
int main() {
int ans = 1, n;
scanf("%d", &(n));
for (int i = (1); i <= (n); i++) {
int v, h;
scanf("%d", &(v));
scanf("%d", &(h));
pair<int, int> x;
x.first = v;
x.second = h;
a[i] = x;
}
int last = a[1].first;
for (int i = (2); i <= (n - 1); i++) {
int c = a[i].first;
int h = a[i].second;
if (c - h > last)
ans++, last = c;
else {
if (a[i + 1].first > c + h)
ans++, last = c + h;
else
last = c;
}
}
if (n > 1) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, h;
} p[100010];
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
int n;
cin >> n;
if (n == 1)
cout << 1 << endl;
else {
for (int i = 0; i < n; i++) {
cin >> p[i].x >> p[i].h;
}
sort(p, p + n, cmp);
long long ans = 2;
for (int i = 1; i < n - 1; i++) {
if (p[i].h < (p[i].x - p[i - 1].x)) {
ans++;
} else if (p[i].h < (p[i + 1].x - p[i].x)) {
ans++;
p[i].x += p[i].h;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[100001] = {};
long long b[100001] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0 || i == n - 1)
ans++;
else if (a[i] - b[i] > a[i - 1])
ans++;
else if (a[i] + b[i] < a[i + 1])
a[i] = a[i] + b[i], ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int x[100010];
int h[100010];
int memo[100010][3];
int dp(int prev, int last, int pos) {
if (memo[pos][prev] != -1) {
return memo[pos][prev];
}
int s1, s2, s3;
s1 = s2 = s3 = 0;
if (x[pos] + h[pos] < x[pos + 1]) {
s1 = 1 + dp(1, x[pos] + h[pos], pos + 1);
}
if (x[pos] - h[pos] > last) {
s2 = 1 + dp(0, x[pos], pos + 1);
}
s3 = dp(0, x[pos], pos + 1);
return memo[pos][prev] = max(s1, max(s2, s3));
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
memset(memo, -1, sizeof(memo));
memo[n - 1][0] = 1;
memo[n - 1][1] = 1;
cout << dp(0, INT_MIN, 0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int x[100000 + 10], h[100000 + 10];
int dp[100000 + 10][2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> x[i] >> h[i];
dp[0][0] = 1;
if (x[0] + h[0] < x[1]) dp[0][1] = 1;
for (int i = 1; i <= n - 1; i++) {
int x1, x2;
x1 = dp[i - 1][0];
x2 = dp[i - 1][1];
if (x[i] - h[i] > x[i - 1]) x1++;
if (x[i] - h[i] > x[i - 1] + h[i - 1]) x2++;
dp[i][0] = max(x1, x2);
x1 = dp[i - 1][0];
x2 = dp[i - 1][1];
int t = max(x1, x2);
if (i == n - 1 || x[i] + h[i] < x[i + 1]) t++;
dp[i][1] = t;
}
cout << max(dp[n - 1][0], dp[n - 1][1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100500][3];
int x[100500];
int h[100500];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d%d", x + i, h + i);
for (int i = 0; i < n; i++) {
if (i == 0) {
dp[i][0] = 1;
if (x[i] + h[i] < x[i + 1]) dp[i][2] = 1;
} else {
if (x[i - 1] < x[i] - h[i])
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
if (x[i - 1] + h[i - 1] < x[i] - h[i])
dp[i][0] = max(dp[i][0], dp[i - 1][2] + 1);
dp[i][1] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
if (x[i + 1] > x[i] + h[i])
dp[i][2] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2])) + 1;
}
}
dp[n - 1][2] = max(dp[n - 2][0], max(dp[n - 2][1], dp[n - 2][2])) + 1;
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t = 1;
while (t--) {
int n;
cin >> n;
vector<pair<int, int>> v;
int x, y;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({x, y});
}
int ans = std::min(n, 2);
int diff[n];
for (int i = 1; i < n; i++) {
diff[i] = v[i].first - v[i - 1].first;
}
for (int i = 1; i < n - 1; i++) {
int height = v[i].second;
if (height < diff[i]) {
ans++;
} else if (height < diff[i + 1]) {
ans++;
diff[i + 1] -= height;
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
int i, tree = 2;
scanf("%d", &n);
int cohi[n][2];
for (i = 0; i < n; i++) {
scanf("%d %d", &cohi[i][0], &cohi[i][1]);
}
if (n == 1)
printf("%d", 1);
else {
for (i = 1; i < n - 1; i++) {
if (abs(cohi[i - 1][0] - cohi[i][0]) > cohi[i][1]) {
tree++;
} else if (abs(cohi[i + 1][0] - cohi[i][0]) > cohi[i][1]) {
tree++;
cohi[i][0] += cohi[i][1];
}
}
printf("%d", tree);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 100 + 10;
int dp[4][MAXN];
long long int x[MAXN];
long long int h[MAXN];
long long int mod = 1000 * 1000 * 1000 + 7;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> h[i];
}
x[n] = 1e18;
dp[0][0] = 0;
dp[2][0] = 1;
if (x[0] + h[0] < x[1]) dp[1][0] = 1;
for (int i = 1; i < n; i++) {
dp[0][i] = max(dp[0][i - 1], max(dp[1][i - 1], dp[2][i - 1]));
if (x[i] + h[i] < x[i + 1]) {
dp[1][i] = dp[0][i] + 1;
}
if (x[i] - h[i] > x[i - 1]) {
dp[2][i] = max(dp[0][i - 1] + 1, dp[2][i - 1] + 1);
if (x[i - 1] + h[i - 1] < x[i] - h[i])
dp[2][i] = max(dp[2][i], dp[1][i - 1] + 1);
}
}
cout << max(dp[1][n - 1], max(dp[0][n - 1], dp[2][n - 1])) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int binary(vector<pair<long long int, long long int> >& v,
long long int n) {
long long int st = 0, ed = (long long int)v.size() - 1LL;
while (st <= ed) {
long long int mid = (st + ed) / 2;
if (v[mid].first == n)
return v[mid].second;
else if (v[mid].first > n)
ed = mid - 1;
else
st = mid + 1;
}
return 0;
}
int main() {
long long int n;
cin >> n;
vector<pair<long long int, long long int> > v(n);
for (auto& x : v) cin >> x.first >> x.second;
if (n == 1) {
cout << 1;
return 0;
}
long long int cnt = 1;
v[0].second = v[0].first - v[0].second;
for (long long int i = 1; i < n - 1; i++) {
if (v[i].first - v[i].second > v[i - 1].first &&
v[i].first - v[i].second > v[i - 1].second) {
cnt++;
v[i].second = v[i].first - v[i].second;
} else if (v[i].first + v[i].second < v[i + 1].first) {
cnt++;
v[i].second = v[i].first + v[i].second;
} else
v[i].second = v[i].first;
}
cout << cnt + 1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const int N = 2e6 + 5;
const int mod = 1e9 + 7;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const int LEVEL = log2(N) + 1;
long long test = 1, n, ans = 0;
vector<pair<long long, long long> > points;
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
int x, h;
cin >> x >> h;
points.push_back({x, h});
}
points.push_back({INF, 0});
long long last = -INF;
sort(points.begin(), points.end());
for (int i = 0; i < n; i++) {
if (points[i].first - points[i].second > last) {
ans++;
last = points[i].first;
} else if (points[i].first + points[i].second < points[i + 1].first) {
ans++;
last = points[i].first + points[i].second;
} else
last = points[i].first;
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout << setprecision(15);
;
for (int i = 1; i <= test; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> arr[100005];
pair<int, int> arr2[100005];
void solve() {
int n;
cin >> n;
for (int i = 0; i <= n - 1; i += 1) {
cin >> arr[i].first >> arr[i].second;
}
if (n == 1) {
cout << "1";
return;
}
arr2[0].first = 1;
(arr[0].first + arr[1].second < arr[1].first) ? arr2[0].second = 1
: arr2[0].second = 0;
for (int i = 1; i <= n - 1; i += 1) {
int pc = arr[i - 1].first, ph = arr[i - 1].second, cc = arr[i].first,
ch = arr[i].second;
int pl = arr2[i - 1].first, pr = arr2[i - 1].second;
if (i == n - 1) {
arr2[i].second = 1 + max(pl, pr);
int k1 = -1, k2 = -1;
if (cc - ch > pc + ph) {
k1 = 1 + pr;
} else {
k1 = pr;
}
if (cc - ch > pc) {
k2 = 1 + pl;
} else {
k2 = pl;
}
arr2[i].first = max(k1, k2);
} else {
int k1 = -1, k2 = -1;
if (cc - ch > pc + ph) {
k1 = 1 + pr;
} else {
k1 = pr;
}
if (cc - ch > pc) {
k2 = 1 + pl;
} else {
k2 = pl;
}
arr2[i].first = max(k1, k2);
int nc = arr[i + 1].first, nh = arr[i + 1].second;
if (cc + ch < nc) {
arr2[i].second = 1 + max(pl, pr);
} else {
arr2[i].second = max(pl, pr);
}
}
}
cout << max(arr2[n - 1].first, arr2[n - 1].second);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = 1;
for (int i = 0; i < n; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
int main() {
int n, x[100000], h[100000], count = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x[i], &h[i]);
}
int position = -1000000000;
for (int i = 0; i < n; i++) {
if (x[i] - h[i] > position) {
position = x[i];
count++;
} else {
if (i < n - 1 && (x[i] + h[i] < x[i + 1]) || i == n - 1) {
position = x[i] + h[i];
count++;
} else
position = x[i];
}
}
printf("%d", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513282306647093844609550582231725359408128481117450284102701938521105559644622948954930381964428810975665933446128475648233786783165271201909145648566923460348610454326648213393607260249141273724587006606315588174881520920962829254091715364367892590360011330530548820466521384146951941511609433057270365759591953092186117381932611793105118548074462379962749567351885752724891227938183011949129833673362440656643086021394946395224737190702179860943702770539217176293176752384674818467669405132000568127145263560827785771342757789609173637178721468440901224953430146549585371050792279689258923542019956112129021960864034418159813629774771309960518707211349999998372978049951059731732816096318595024459455346908302642522308253344685035261931188171010003137838752886587533208381420617177669147303598253490428755468731159562863882353787593751957781857780532171226806613001927876611195909216420198938095257201065485863278865936153381827968230301952;
const long long INF = 1e18;
long long gcd(long long x, long long y) { return (y == 0 ? x : gcd(y, x % y)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool isprime(long long u) {
for (long long i = 2; i <= (int)sqrt(u); i++) {
if (u % i == 0) return 0;
}
return 1;
}
int main() {
vector<long long> x;
vector<long long> h;
int n, i, r, nb = 1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> r;
x.push_back(r);
cin >> r;
h.push_back(r);
}
x.push_back(INF);
for (i = 1; i < n; i++) {
if (x[i] - x[i - 1] > h[i])
nb++;
else if (x[i + 1] - x[i] > h[i]) {
nb++;
x[i] += h[i];
}
}
cout << nb;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, c;
pair<long long, long long> arr[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (long long i = (long long)(1); i <= (long long)(n); i++)
cin >> arr[i].first >> arr[i].second;
c = min((long long)2, n);
for (long long i = (long long)(2); i <= (long long)(n - 1); i++) {
if (arr[i].first - arr[i].second > arr[i - 1].first)
c++;
else if (arr[i].first + arr[i].second < arr[i + 1].first) {
arr[i].first = arr[i].first + arr[i].second;
c++;
}
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long powermod(long long a, long long b) {
if (b == 0) return 1;
long long x = powermod(a, b / 2);
x = x * x;
if (b & 1) x = x * a;
return x;
}
void solve() {
long long i, j, k, n, m;
cin >> n;
vector<long long> x(n), h(n);
for (i = (0); i < (n); i++) cin >> x[i] >> h[i];
long long curr = -1e10;
long long ans = 0;
for (i = (0); i < (n); i++) {
if (curr <= x[i] - h[i]) {
ans++;
curr = x[i] + 1;
continue;
}
curr = x[i] + 1;
if (i == n - 1 || x[i] + h[i] < x[i + 1]) {
ans++;
curr = x[i] + h[i] + 1;
}
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a[100000][2], i, n, ans = 1, l;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
l = a[0][0];
for (i = 1; i < n - 1; i++) {
if ((a[i][0] - a[i][1]) > l) {
ans++;
l = a[i][0];
} else if ((a[i][0] + a[i][1]) < a[i + 1][0]) {
ans++;
l = a[i][0] + a[i][1];
} else
l = a[i][0];
}
if (n > 1) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x, i, y, count = 1;
cin >> n;
vector<pair<long long, long long>> v;
for (i = 0; i < n; i++) {
cin >> x >> y;
v.push_back(make_pair(x, y));
}
long last = v[n - 1].second + v[n - 1].first + 1;
for (i = n - 1; i > 0; i--) {
if (v[i].first + v[i].second < last) {
last = v[i].first;
count++;
} else if (i != 0 && v[i].first - v[i].second > v[i - 1].first) {
count++;
last = v[i].first - v[i].second;
} else if (v[i].first < last) {
last = v[i].first;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
int a[100001], b[100001], n, i, j, s = 2;
int main() {
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d%d", &a[i], &b[i]);
for (i = 1; i < n - 1; i++) {
if (a[i] - a[i - 1] > b[i])
s++;
else if (a[i + 1] - a[i] > b[i]) {
s++;
a[i] += b[i];
}
}
printf("%d", n == 1 ? 1 : s);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, x, y, ans = 2;
pair<int, int> a[maxn];
int main() {
cin >> n;
if (n == 1) {
return cout << 1, 0;
}
for (int i = 0; i < n; i++) {
cin >> x >> y;
a[i] = make_pair(x, y);
}
for (int i = 1; i < n - 1; i++) {
if (a[i].first - a[i - 1].first > a[i].second) {
ans++;
} else {
if (a[i + 1].first - a[i].first > a[i].second) {
ans++;
a[i].first += a[i].second;
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int n, count = 1, i;
cin >> n;
int a[n + 1], b[n];
a[n] = 2000000001;
for (i = 0; i < n; i++) cin >> a[i] >> b[i];
for (i = 1; i < n; i++)
if (a[i] - a[i - 1] > b[i])
++count;
else if (a[i + 1] - a[i] > b[i])
a[i] += b[i], ++count;
cout << count;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.first) return (a.second < b.second);
return (a.first < b.first);
}
vector<long long int> prime(1000005, 1);
void p() {
long long int i, j;
for (i = 2; i <= 1000000; i++) {
if (prime[i] == 1) {
for (j = 2 * i; j <= 1000000; j += i) prime[j] = 0;
}
}
}
void solve() {
long long int n, i;
cin >> n;
vector<long long int> a(n), h(n);
for (i = 0; i < (n); i++) cin >> a[i] >> h[i];
vector<long long int> dp(n);
dp[0] = a[0];
dp[n - 1] = a[n - 1];
long long int counter;
if (n == 1)
counter = 1;
else
counter = 2;
for (i = 1; i < n - 1; i++) {
if (dp[i - 1] < a[i] - h[i]) {
dp[i] = a[i];
counter++;
} else if (a[i] + h[i] < a[i + 1]) {
dp[i] = a[i] + h[i];
counter++;
} else {
dp[i] = a[i];
}
}
cout << counter << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<long long> dp[3];
dp[0].assign(n, 0);
dp[1].assign(n, 0);
dp[2].assign(n, 0);
long long x, h, px = -9000000000, ph = 0, M = 1;
for (int i = 0; i < n; ++i) {
cin >> x >> h;
if (i > 0) {
if (px + ph < x) dp[2][i - 1] = 1 + dp[1][i - 1];
if (x - h > px + ph) dp[0][i] = dp[2][i - 1] + 1;
if (x - h > px)
dp[0][i] = max(dp[0][i], max(1 + dp[1][i - 1], 1 + dp[0][i - 1]));
dp[1][i] = max(dp[0][i - 1], max(dp[1][i - 1], dp[2][i - 1]));
M = max(M, max(dp[2][i - 1], max(dp[0][i], dp[1][i])));
if (i == n - 1) {
dp[2][i] = 1 + dp[1][i];
M = max(M, dp[2][i]);
}
} else {
dp[0][i] = 1;
dp[1][i] = 0;
}
px = x;
ph = h;
}
cout << M << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100001], b[100001];
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
int s = 2;
for (int i = 2; i <= n - 1; i++)
if (a[i] - a[i - 1] > b[i])
s++;
else if (a[i + 1] - a[i] > b[i]) {
s++;
a[i] += b[i];
}
if (n == 1) s = 1;
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int S = 100010;
int x[S], h[S];
int main(int argc, const char* argv[]) {
int a = 2;
int n;
cin >> n;
if (n == 1) {
cout << 1;
return 0;
}
for (int i = 0; i < n; i++) cin >> x[i] >> h[i];
int left = x[0];
for (int i = 1; i < n - 1; i++) {
if (left < (x[i] - h[i])) {
a++;
left = x[i];
} else if ((x[i] + h[i]) < x[i + 1]) {
a++;
left = x[i] + h[i];
} else
left = x[i];
}
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int m, n, k, x[200000], h[200000], ans[200000];
deque<int> q;
int main() {
cin >> n;
for (int i = 0; i < (int)(n); i++) cin >> x[i] >> h[i];
m = 2;
if (n == 1) {
cout << 1;
return 0;
}
ans[0] = 1;
int f = 0;
for (int i = 1; i < (int)(n - 1); i++) {
if (h[i] + x[i - 1] < x[i] && !f) {
m++;
} else if (h[i] + h[i - 1] + x[i - 1] < x[i] && f) {
m++;
f = 0;
} else {
if (x[i + 1] - x[i] > h[i]) {
f = 1;
m++;
} else {
f = 0;
}
}
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
long long t = 1, n;
pair<long long, long long> ar[N];
long long dp[N];
long long recur(long long i, long long j) {
if (i >= n) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
long long count = LLONG_MIN;
if (ar[i].first - ar[i].second > j) {
count = max(count, 1 + recur(i + 1, ar[i].first));
}
if (i + 1 < n && ar[i].first + ar[i].second < ar[i + 1].first) {
count = max(count, 1 + recur(i + 1, ar[i].first + ar[i].second));
} else if (i == n - 1) {
count = max(count, 1 + recur(i + 1, ar[i].first + ar[i].second));
}
count = max(count, recur(i + 1, ar[i].first));
return dp[i] = count;
}
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ar[i].first >> ar[i].second;
}
memset(dp, -1, sizeof dp);
cout << recur(0, LLONG_MIN) << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, l, ans = 0, a[100005], r[100005];
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i] >> r[i];
a[n] = 1e18;
l = -1e18;
for (int i = 0; i < n; i++) {
if (a[i] - r[i] > l) {
ans++;
l = a[i];
continue;
} else if (a[i] + r[i] < a[i + 1]) {
ans++;
l = a[i] + r[i];
continue;
} else
l = a[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long int n, x, h, a, b, max = 1;
vector<long int> xs;
vector<long int> hs;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> h;
xs.push_back(x);
hs.push_back(h);
}
xs.push_back(2000000005);
a = xs[0] - hs[0];
b = xs[0];
for (int i = 1; i < n; i++) {
if ((b < xs[i] - hs[i]) && (xs[i - 1] < xs[i] - hs[i])) {
a = xs[i] - hs[i];
b = xs[i];
max++;
} else {
if (xs[i] + hs[i] < xs[i + 1]) {
a = xs[i];
b = xs[i] + hs[i];
max++;
}
}
}
cout << max << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long n;
scanf("%ld\n", &n);
std::vector<long> x(n);
std::vector<long> h(n);
for (int p = 0; p < n; p++) {
scanf("%ld %ld\n", &x[p], &h[p]);
}
long count = (n == 1) ? 1 : 2;
for (int p = 1; p < n - 1; p++) {
if (x[p] - x[p - 1] > h[p]) {
++count;
} else if (x[p + 1] - x[p] > h[p]) {
++count;
x[p] += h[p];
}
}
printf("%ld\n", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x[100001], h[100001], f0[100001], f1[100001], f2[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", x + i, h + i);
f0[1] = 0;
f1[1] = 1;
f2[1] = (x[2] - x[1] >= h[1]) ? 1 : 0;
for (int i = 2; i <= n; i++) {
f0[i] = max(f0[i - 1], max(f1[i - 1], f2[i - 1]));
f1[i] = max(f0[i - 1], max(f1[i - 1], f2[i - 1]));
if (x[i] - x[i - 1] > h[i] + h[i - 1])
f1[i] = max(f0[i - 1], max(f1[i - 1], f2[i - 1])) + 1;
else if (x[i] - x[i - 1] > h[i])
f1[i] = max(f0[i - 1], f1[i - 1]) + 1;
f2[i] = max(f0[i - 1], max(f1[i - 1], f2[i - 1]));
if (i == n || x[i + 1] - x[i] > h[i]) f2[i]++;
}
printf("%d", max(f0[n], max(f1[n], f2[n])));
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[100005];
int main() {
int n, ans = 2, g = -1;
cin >> n;
if (n < 3) {
cout << n;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
for (int i = 1; i < n - 1; i++) {
if (a[i].first - a[i].second > a[i - 1].first && g != i) {
ans++;
g = i;
} else if (a[i].first + a[i].second < a[i + 1].first && g != i) {
ans++;
a[i].first += a[i].second;
g = i;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> A(n);
for (auto& [x, h] : A) cin >> x >> h;
int n_cut = min(2, (int)A.size());
for (int i = 1; i < (int)A.size() - 1; ++i) {
int x_prev = A[i - 1].first, x_next = A[i + 1].first;
int x = A[i].first, h = A[i].second;
if (x_prev < x - h) {
++n_cut;
} else if (x + h < x_next) {
++n_cut;
A[i].first = x + h;
}
}
cout << n_cut << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> x(n), h(n);
for (long long i = 0; i < n; i++) cin >> x[i] >> h[i];
long long l = -1e9 - 10;
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (x[i] - h[i] > l) {
ans++;
l = x[i];
} else if (i == n - 1 || x[i] + h[i] < x[i + 1]) {
ans++;
l = x[i] + h[i];
} else
l = x[i];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100004;
const int Inf = 1e9 + 7;
int dp[N][4];
pair<int, int> arr[N];
int n;
int h[N], x[N];
int dir[N];
int dfs(int i, int f) {
if (i == n + 1) return 0;
if (f == 2)
if (arr[i].first <= arr[i - 1].first + arr[i - 1].second) return -Inf;
if (dp[i][f] != -1) return dp[i][f];
int res = 0;
if (f == 0 || f == 1) {
res = max(res, dfs(i + 1, 0));
if (arr[i].first - arr[i].second > arr[i - 1].first)
res = max(res, 1 + dfs(i + 1, 1));
res = max(res, 1 + dfs(i + 1, 2));
} else {
res = max(res, dfs(i + 1, 0));
if (arr[i].first - arr[i].second > arr[i - 1].first + arr[i - 1].second)
res = max(res, 1 + dfs(i + 1, 1));
res = max(res, 1 + dfs(i + 1, 2));
}
dp[i][f] = res;
return res;
}
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++) {
scanf("%d %d", &x[i], &h[i]);
arr[i] = (make_pair(x[i], h[i]));
}
memset(dp, -1, sizeof(dp));
int ans = 1 + dfs(2, 1);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int sz = 100010;
int x[sz], h[sz];
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 1;
return 0;
}
int ans = 2;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> h[i];
}
int left = x[0];
for (int i = 1; i < n - 1; ++i) {
if (left < (x[i] - h[i])) {
++ans;
left = x[i];
} else if ((x[i] + h[i]) < x[i + 1]) {
++ans;
left = x[i] + h[i];
} else {
left = x[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 4;
int x[MAX], h[MAX], n, dp[MAX][3];
int rec(int i, int d) {
if (dp[i][d] != 0) return dp[i][d];
if (i == n + 1)
dp[i][d] = 0;
else if (d == 1 || d == 0) {
if (x[i] - h[i] > x[i - 1])
dp[i][d] = 1 + rec(i + 1, 0);
else
dp[i][d] = max(1 + rec(i + 1, 2), rec(i + 1, 1));
} else {
if (x[i - 1] + h[i - 1] >= x[i])
dp[i][d] = INT_MIN;
else if (x[i] - h[i] > x[i - 1] + h[i - 1])
dp[i][d] = 1 + rec(i + 1, 0);
else
dp[i][d] = max(1 + rec(i + 1, 2), rec(i + 1, 1));
}
return dp[i][d];
}
int main() {
cin >> n;
x[0] = INT_MIN, h[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> x[i] >> h[i];
}
cout << rec(1, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void printarr(int arr[], int n) {
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
}
void printarr(vector<int> arr) {
int n = arr.size();
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long test, ti, n, i;
cin >> n;
long long x[n], h[n], g[n + 1];
g[0] = INT_MAX;
g[n] = INT_MAX;
for (int i = 0; i < (n); i++) cin >> x[i] >> h[i];
for (int i = (1); i < (n); i++) g[i] = x[i] - x[i - 1];
long long cnt = 0;
for (int i = 0; i < (n); i++) {
if (h[i] < g[i])
cnt++;
else if (h[i] < g[i + 1]) {
cnt++;
g[i + 1] -= h[i];
}
}
cout << cnt << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e5 + 5;
void pairsort(long long a[], long long b[], long long n) {
pair<long long, long long> pairt[n];
for (long long i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (long long i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long isPrime(long long n) {
if (n < 2) return 0;
if (n < 4) return 1;
if (n % 2 == 0 or n % 3 == 0) return 0;
for (long long i = 5; i * i <= n; i += 6)
if (n % i == 0 or n % (i + 2) == 0) return 0;
return 1;
}
long long C(long long n, long long r) {
if (r > n - r) r = n - r;
long long ans = 1;
for (long long i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
long long res = 1;
x = x % mod;
while (p) {
if (p % 2) res = res * x;
p >>= 1;
x = x * x % mod;
res %= mod;
}
return res;
}
long long n, a[N], h[N], ans;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
ans = (2 < n ? 2 : n);
for (long long i = 1; i <= n; i++) cin >> a[i] >> h[i];
for (long long i = 2; i <= n - 1; i++) {
if (a[i - 1] < a[i] - h[i])
ans++;
else if (a[i] + h[i] < a[i + 1])
ans++, a[i] += h[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
void read_int32_t(FILE *__restrict stream, int32_t *__restrict nr) {
uint8_t ch;
*nr = 0;
while ((ch = fgetc(stream)) && ('0' <= ch && ch <= '9')) {
*nr *= 10;
*nr += ch - '0';
}
}
struct save_tree {
int32_t pos;
int32_t h;
};
int32_t dp[100001];
uint8_t fall[100001];
struct save_tree trees[100001];
int32_t last;
int32_t n;
int32_t max(int32_t o1, int32_t o2) { return o1 > o2 ? o1 : o2; }
void update(int32_t pos) {
last = max(last, trees[pos - 1].pos);
dp[pos] = dp[pos - 1];
if (fall[pos - 1] == 0 &&
(trees[pos - 1].pos + trees[pos - 1].h < trees[pos].pos)) {
last = trees[pos - 1].pos + trees[pos - 1].h;
++dp[pos];
fall[pos - 1] = 1;
}
if (trees[pos].pos - trees[pos].h > last) {
last = trees[pos].pos;
++dp[pos];
fall[pos] = 1;
}
}
int main(void) {
{
read_int32_t(stdin, &n);
{
int32_t i;
for (i = 0; i < n; ++i) {
read_int32_t(stdin, &trees[i].pos);
read_int32_t(stdin, &trees[i].h);
}
}
}
{
last = trees[0].pos;
fall[0] = 1;
dp[0] = 1;
{
int32_t i;
for (i = 1; i < n; ++i) {
update(i);
}
}
}
{
if (fall[n - 1] == 1) {
fprintf(stdout, "%u", dp[n - 1]);
} else {
fprintf(stdout, "%u", dp[n - 1] + 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const oo = INT_MAX;
int main() {
int n;
cin >> n;
int v[n][2];
for (int i = 0; i < n; i++) {
cin >> v[i][0] >> v[i][1];
}
int c = min(2, n);
for (int i = 1; i < n - 1; i++) {
if (v[i][0] - v[i][1] > v[i - 1][0])
c++;
else if (v[i][0] + v[i][1] < v[i + 1][0]) {
c++;
v[i][0] += v[i][1];
}
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod(long long int x) {
if (x >= 0)
return x;
else
return -x;
}
int main() {
long long int n;
cin >> n;
long long int a[n][2];
for (long long int i = 0; i < n; ++i) {
cin >> a[i][0] >> a[i][1];
}
if (n <= 2) {
cout << n;
return 0;
}
long long int count = 0, x = a[0][0];
for (long long int i = 1; i < n - 1; ++i) {
if (a[i][0] - a[i][1] > x) {
x = a[i][0];
count++;
continue;
}
if (a[i][0] + a[i][1] < a[i + 1][0]) {
x = a[i][0] + a[i][1];
count++;
continue;
}
x = a[i][0];
}
cout << count + 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> h(n), coor(n);
for (int i = 0; i < n; i++) cin >> coor[i] >> h[i];
int c = 2;
if (n == 1) c--;
for (int i = 1; i < n - 1; i++) {
if (coor[i] - coor[i - 1] - h[i] > 0) {
c++;
} else if (coor[i + 1] - coor[i] - h[i] > 0) {
coor[i] = coor[i] + h[i];
c++;
}
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
vector<int> adj[200010], dis1(300010, -1), vis(300010, 0), dis(300010, -1);
int myrandom(int i) { return std::rand() % i; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
if (n == 1) {
cout << 1 << '\n';
return 0;
}
long long dp[n + 1][2];
memset(dp, 0, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
if (v[i].first - v[i - 1].first > v[i - 1].second) {
dp[i][0] = max(dp[i][0], dp[i - 1][0] + 1);
}
if (v[i].first - v[i - 1].first > v[i].second) {
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0]) + 1;
}
if (v[i].first - v[i - 1].first > v[i].second + v[i - 1].second) {
dp[i][1] = max(dp[i][1], dp[i - 1][0] + 2);
}
}
cout << max(dp[n - 1][0] + 1, dp[n - 1][1]) << '\n';
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.