// Om Namah Shivaya
// GM in 95 days
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
template<typename T>
struct lazysegtree {
/*=======================================================*/
struct data {
int a;
};
struct lazy {
int a;
};
data d_neutral = {0};
lazy l_neutral = {0};
void merge(data &curr, data &left, data &right) {
}
void create(int x, int lx, int rx, T v) {
tr[x].a = v;
}
void modify(int x, int lx, int rx, T v) {
lz[x].a = v;
}
void propagate(int x, int lx, int rx) {
int val = lz[x].a;
tr[x].a += val;
if (rx - lx > 1) {
lz[2 * x + 1].a += val;
lz[2 * x + 2].a += val;
}
lz[x] = l_neutral;
}
/*=======================================================*/
int siz = 1;
vector<data> tr;
vector<lazy> lz;
lazysegtree() {
}
lazysegtree(int n) {
while (siz < n) siz *= 2;
tr.assign(2 * siz, d_neutral);
lz.assign(2 * siz, l_neutral);
}
void build(vector<T> &a, int n, int x, int lx, int rx) {
if (rx - lx == 1) {
if (lx < n) {
create(x, lx, rx, a[lx]);
}
return;
}
int mid = (lx + rx) / 2;
build(a, n, 2 * x + 1, lx, mid);
build(a, n, 2 * x + 2, mid, rx);
merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
}
void build(vector<T> &a, int n) {
build(a, n, 0, 0, siz);
}
void rupd(int l, int r, T v, int x, int lx, int rx) {
propagate(x, lx, rx);
if (lx >= r or rx <= l) return;
if (lx >= l and rx <= r) {
modify(x, lx, rx, v);
propagate(x, lx, rx);
return;
}
int mid = (lx + rx) / 2;
rupd(l, r, v, 2 * x + 1, lx, mid);
rupd(l, r, v, 2 * x + 2, mid, rx);
merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
}
void rupd(int l, int r, T v) {
rupd(l, r + 1, v, 0, 0, siz);
}
data query(int l, int r, int x, int lx, int rx) {
propagate(x, lx, rx);
// if (lx >= r or rx <= l) return d_neutral;
if (lx >= l and rx <= r) return tr[x];
int mid = (lx + rx) / 2;
if (l < mid) return query(l, r, 2 * x + 1, lx, mid);
else return query(l, r, 2 * x + 2, mid, rx);
}
data query(int l, int r) {
return query(l, r + 1, 0, 0, siz);
}
};
void solve(int test_case)
{
// references:
// https://oj.uz/submission/549945
// https://csacademy.com/contest/round-41/task/candles/solution/
// https://csacademy.com/submission/371177/
int n, m; cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
lazysegtree<int> st(n);
st.build(a, n);
auto first = [&](int x) {
// returns first occurrence of x in the segtree
int l = 0, r = n - 1;
int pos = -1;
while (l <= r) {
int mid = (l + r) / 2;
int res = st.query(mid, mid).a;
if (res >= x) {
pos = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
return pos;
};
auto last = [&](int x) {
// returns last occurrence of x in the segtree
int l = 0, r = n - 1;
int pos = -1;
while (l <= r) {
int mid = (l + r) / 2;
int res = st.query(mid, mid).a;
if (res > x) {
r = mid - 1;
}
else {
pos = mid;
l = mid + 1;
}
}
return pos;
};
auto upper_bound = [&](int x) {
// returns first position where value > x
int l = 0, r = n - 1;
int pos = n;
while (l <= r) {
int mid = (l + r) / 2;
int res = st.query(mid, mid).a;
if (res > x) {
pos = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
return pos;
};
auto lower_bound = [&](int x) {
// returns first position where value >= x
int l = 0, r = n - 1;
int pos = n;
while (l <= r) {
int mid = (l + r) / 2;
int res = st.query(mid, mid).a;
if (res >= x) {
pos = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
return pos;
};
while (m--) {
char ch; cin >> ch;
if (ch == 'F') {
int c, h; cin >> c >> h;
int l = lower_bound(h);
int r = min(l + c - 1, n - 1);
int mx = st.query(r, r).a;
int firstpos = first(mx);
int lastpos = last(mx);
st.rupd(l, firstpos - 1, 1);
int len1 = r - l + 1;
int len2 = max((firstpos - 1) - l + 1, 0);
int left = len1 - len2;
st.rupd(lastpos - left + 1, lastpos, 1);
// rep(i, n) {
// cout << st.query(i, i).a << " ";
// }
// cout << endl;
}
else {
int l, r; cin >> l >> r;
int ans = upper_bound(r) - lower_bound(l);
cout << ans << endl;
}
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
Compilation message
grow.cpp: In function 'void usaco(std::string)':
grow.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
310 ms |
3072 KB |
Output is correct |
| 2 |
Correct |
471 ms |
4488 KB |
Output is correct |
| 3 |
Correct |
398 ms |
4348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
340 KB |
Output is correct |
| 2 |
Correct |
5 ms |
404 KB |
Output is correct |
| 3 |
Correct |
6 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
164 ms |
676 KB |
Output is correct |
| 6 |
Correct |
225 ms |
984 KB |
Output is correct |
| 7 |
Correct |
14 ms |
468 KB |
Output is correct |
| 8 |
Correct |
101 ms |
1128 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
186 ms |
956 KB |
Output is correct |
| 2 |
Correct |
193 ms |
1952 KB |
Output is correct |
| 3 |
Correct |
3 ms |
468 KB |
Output is correct |
| 4 |
Correct |
127 ms |
1384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
185 ms |
1128 KB |
Output is correct |
| 2 |
Correct |
244 ms |
1724 KB |
Output is correct |
| 3 |
Correct |
26 ms |
468 KB |
Output is correct |
| 4 |
Correct |
194 ms |
1984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
318 ms |
1908 KB |
Output is correct |
| 2 |
Correct |
425 ms |
4052 KB |
Output is correct |
| 3 |
Correct |
57 ms |
1364 KB |
Output is correct |
| 4 |
Correct |
335 ms |
4064 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
408 ms |
2936 KB |
Output is correct |
| 2 |
Correct |
434 ms |
4128 KB |
Output is correct |
| 3 |
Correct |
431 ms |
4428 KB |
Output is correct |
| 4 |
Correct |
51 ms |
1268 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
353 ms |
3116 KB |
Output is correct |
| 2 |
Correct |
306 ms |
4084 KB |
Output is correct |
| 3 |
Correct |
399 ms |
4404 KB |
Output is correct |
| 4 |
Correct |
51 ms |
1236 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
479 ms |
2976 KB |
Output is correct |
| 2 |
Correct |
439 ms |
2980 KB |
Output is correct |
| 3 |
Correct |
68 ms |
3468 KB |
Output is correct |
| 4 |
Correct |
389 ms |
3900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
400 ms |
3080 KB |
Output is correct |
| 2 |
Correct |
444 ms |
4468 KB |
Output is correct |
| 3 |
Correct |
621 ms |
4636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
391 ms |
3376 KB |
Output is correct |
