#include <bits/stdc++.h>
using namespace std;
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair <int, int>
#define ull unsigned long long
// #define int long long
// #define int unsigned long long
const ll inf = 1e18 + 7;
const ll weirdMod = 998244353;
struct node {
int mn, mx;
} t[400040];
int lazy[400040], n, m;
void prop(int v, int tl, int tr) {
t[v].mn += lazy[v];
t[v].mx += lazy[v];
if (tl != tr) {
lazy[2 * v] += lazy[v];
lazy[2 * v + 1] += lazy[v];
} lazy[v] = 0;
}
void set_val(int v, int tl, int tr, int pos, int val) {
if (tl == tr) {
t[v].mx = t[v].mn = val;
return;
} int tm = (tl + tr) / 2;
if (pos <= tm)
set_val(2 * v, tl, tm, pos, val);
else set_val(2 * v + 1, tm + 1, tr, pos, val);
t[v].mn = min(t[2 * v].mn, t[2 * v + 1].mn);
t[v].mx = max(t[2 * v].mx, t[2 * v + 1].mx);
}
int get_val(int v, int tl, int tr, int pos) {
if (lazy[v])
prop(v, tl, tr);
if (tl == tr)
return t[v].mn;
int tm = (tl + tr) / 2;
if (pos <= tm)
return get_val(2 * v, tl, tm, pos);
else return get_val(2 * v + 1, tm + 1, tr, pos);
t[v].mn = min(t[2 * v].mn, t[2 * v + 1].mn);
t[v].mx = max(t[2 * v].mx, t[2 * v + 1].mx);
}
void add_one(int v, int tl, int tr, int l, int r) {
if (lazy[v])
prop(v, tl, tr);
if (tr < l || r < tl)
return;
if (l <= tl && tr <= r) {
t[v].mn++; t[v].mx++;
if (tl != tr) {
lazy[2 * v]++;
lazy[2 * v + 1]++;
} return;
} int tm = (tl + tr) / 2;
add_one(2 * v, tl, tm, l, min(r, tm));
add_one(2 * v + 1, tm + 1, tr, max(l, tm + 1), r);
t[v].mn = min(t[2 * v].mn, t[2 * v + 1].mn);
t[v].mx = max(t[2 * v].mx, t[2 * v + 1].mx);
}
int find_first(int v, int tl, int tr, int val) {
if (lazy[v])
prop(v, tl, tr);
if (t[v].mx < val) return tr + 1;
if (tl == tr) return tl;
int tm = (tl + tr) / 2;
int pos = find_first(2 * v, tl, tm, val), ans;
if (pos == tm + 1) {
ans = find_first(2 * v + 1, tm + 1, tr, val);
t[v].mn = min(t[2 * v].mn, t[2 * v + 1].mn);
t[v].mx = max(t[2 * v].mx, t[2 * v + 1].mx);
return ans;
} else return pos;
}
int find_last(int v, int tl, int tr, int val) {
if (lazy[v]) prop(v, tl, tr);
if (val < t[v].mn) return tl - 1;
if (tl == tr) return tl;
int tm = (tl + tr) / 2;
int pos = find_last(2 * v + 1, tm + 1, tr, val), ans;
if (pos == tm) {
ans = find_last(2 * v, tl, tm, val);
t[v].mn = min(t[2 * v].mn, t[2 * v + 1].mn);
t[v].mx = max(t[2 * v].mx, t[2 * v + 1].mx);
return ans;
} else return pos;
}
void upd_query(int c, int h) {
int pos = find_first(1, 1, n, h);
int num = get_val(1, 1, n, min(n, pos + c - 1));
int l = find_first(1, 1, n, num), r = find_last(1, 1, n, num); c -= l - pos;
add_one(1, 1, n, pos, l - 1); add_one(1, 1, n, max(l, r - c + 1), r);
}
void ans_query(int l, int r) {
l = find_first(1, 1, n, l);
r = find_last(1, 1, n, r);
cout << r - l + 1 << '\n';
}
void solve() {
cin >> n >> m;
vector<int> vec(n);
for (auto &v : vec) cin >> v;
sort(vec.begin(), vec.end());
for (int i = 1; i <= n; i++)
set_val(1, 1, n, i, vec[i - 1]);
char v; int l, r;
for (int i = 1; i <= m; i++) {
cin >> v >> l >> r;
if (v == 'F') upd_query(l, r);
else ans_query(l, r);
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
} return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
80 ms |
3796 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
2 ms |
448 KB |
Output is correct |
| 4 |
Correct |
2 ms |
416 KB |
Output is correct |
| 5 |
Correct |
40 ms |
1048 KB |
Output is correct |
| 6 |
Incorrect |
50 ms |
1224 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
40 ms |
784 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
28 ms |
724 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
77 ms |
2176 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
106 ms |
3780 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
59 ms |
3780 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
112 ms |
3868 KB |
Output is correct |
| 2 |
Incorrect |
115 ms |
4244 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
84 ms |
3772 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
94 ms |
4236 KB |
Output is correct |
