#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, mod = 1e9 + 7, inf = 1e9 + 5;
int tree[N * 4], lazy[N * 4];
int n;
void prob(int l, int r, int node)
{
tree[node] += lazy[node];
if (l != r)
lazy[node * 2] += lazy[node], lazy[node * 2 + 1] += lazy[node];
lazy[node] = 0;
}
void update(int lq, int rq, int val, int l = 1, int r = n, int node = 1)
{
prob(l, r, node);
if (lq <= l && r <= rq)
{
lazy[node] += val;
prob(l, r, node);
return;
}
if (r < lq || l > rq)
return;
int mid = (l + r) / 2;
update(lq, rq, val, l, mid, node * 2), update(lq, rq, val, mid + 1, r, node * 2 + 1);
tree[node] = max(tree[node * 2], tree[node * 2 + 1]);
}
int query(int lq, int rq, int l = 1, int r = n, int node = 1)
{
prob(l, r, node);
if (lq <= l && r <= rq)
return tree[node];
if (r < lq || l > rq)
return 0;
int mid = (l + r) / 2;
return max(query(lq, rq, l, mid, node * 2), query(lq, rq, mid + 1, r, node * 2 + 1));
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n;
vector<pair<int, int>> arr(n + 1);
for (int i = 1; i <= n; i++)
cin >> arr[i].first >> arr[i].second;
int q;
cin >> q;
while (q--)
{
int l, r;
cin >> l >> r;
int lst = l;
int ans = 1;
for (int i = l; i <= r; i++)
{
update(arr[i].first, arr[i].second, 1);
if (query(1, n) > 1)
{
ans++;
for (int k = lst; k < i; k++)
update(arr[k].first, arr[k].second, -1);
lst = i;
}
}
for (int i = lst; i <= r; i++)
update(arr[i].first, arr[i].second, -1);
cout << ans << "\n";
}
}
/*
3
1
3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
32 ms |
9808 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
108 ms |
2684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
108 ms |
2684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
113 ms |
10064 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
32 ms |
9808 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
