#undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
#pragma GCC target("movbe") // byte swap
#pragma GCC target("aes,pclmul,rdrnd") // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define enablell 1
typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;
#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};
template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif
#endif
#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("E:\\desktop\\code\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\Comp Prog\\x64\\Debug\\1.in");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");
#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif
#if FAST_INPUT && !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif
#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define ceildiv(x,y) ((x + y - 1) / y)
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31
#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0}, {0,0} };
struct Tree
{
int n;
vi tree;
vi lazy;
Tree(vi& arr) : n(arr.size()), tree(n * 4, 0), lazy(n * 4, 0)
{
rep(i, n) add(1, 0, n - 1, i, i, arr[i]);
}
void add(int x, int l, int r, int ql, int qr, int v)
{
if (r<ql || l>qr) return;
if (l >= ql && r <= qr) lazy[x] += v, tree[x]+=v;
else
{
int mid = (l + r) / 2;
add(x * 2, l, mid, ql, qr, v);
add(x * 2 + 1, mid + 1, r, ql, qr, v);
}
}
void add(int ql, int qr) { add(1, 0, n - 1, ql, qr, 1); }
int query(int x, int l, int r, int v)
{
if (v<l || v>r) return 0;
if (v == l && r == v) return tree[x];
int mid = (l + r) / 2;
lazy[x * 2] += lazy[x];
tree[x * 2] += lazy[x];
lazy[x * 2 + 1] += lazy[x];
tree[x * 2 + 1] += lazy[x];
lazy[x] = 0;
return query(x * 2, l, mid, v) + query(x * 2 + 1, mid + 1, r, v);
}
int query(int q) { return query(1, 0, n - 1, q); }
int firstsmaller(int v)
{
int lo = 0;
int hi = n;
while (hi-lo>1)
{
int mid = (lo + hi) / 2;
if (query(mid) >= v) hi = mid;
else lo = mid;
}
if (query(lo) == query(hi)) return lo;
return hi;
}
int firstlarger(int v)
{
int lo = -1;
int hi = n;
while (hi-lo>1)
{
int mid = (lo + hi) / 2;
if (query(mid) <= v) lo = mid;
else hi = mid;
}
return hi;
}
};
int32_t main()
{
fast();
dread2(int, n, m);
readvector(int, nums, n);
sort(all(nums));
Tree tree(nums);
rep(i, m)
{
dread(char, t);
if (t=='F')
{
dread2(int, c, h);
int l = tree.firstlarger(h-1);
if (l+c>=n)
{
tree.add(l, n - 1);
}
else
{
int k = tree.query(l + c - 1);
if (tree.query(l) == k)
{
int ke = tree.firstlarger(k);
tree.add(ke - 1 - c + 1, ke - 1);
}
else
{
int ks = tree.firstsmaller(k);
tree.add(l, ks - 1);
int ke = tree.firstlarger(k);
tree.add(ke - (c - (ks - l)), ke - 1);
}
}
#if 0
rep(i, n)
{
cout << tree.query(i) << " ";
}
cout << "*\n";
#endif
}
else
{
dread2(int, l, r);
int a = tree.firstsmaller(r + 1) - tree.firstlarger(l - 1);
if (r<tree.query(0))
{
a = 0;
}
#if 0
int k = 0;
rep(i, n) k += tree.query(i) <= r && tree.query(i) >= l;
if (k != a) cout << "lol";
#endif
cout << a << "\n";
}
}
quit;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
442 ms |
6640 KB |
Output is correct |
| 2 |
Correct |
610 ms |
8092 KB |
Output is correct |
| 3 |
Correct |
244 ms |
7752 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
468 KB |
Output is correct |
| 2 |
Correct |
8 ms |
468 KB |
Output is correct |
| 3 |
Correct |
11 ms |
612 KB |
Output is correct |
| 4 |
Correct |
5 ms |
468 KB |
Output is correct |
| 5 |
Correct |
248 ms |
1748 KB |
Output is correct |
| 6 |
Correct |
322 ms |
2032 KB |
Output is correct |
| 7 |
Correct |
19 ms |
724 KB |
Output is correct |
| 8 |
Correct |
234 ms |
1480 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
293 ms |
1144 KB |
Output is correct |
| 2 |
Correct |
312 ms |
2296 KB |
Output is correct |
| 3 |
Correct |
5 ms |
852 KB |
Output is correct |
| 4 |
Correct |
269 ms |
1724 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
293 ms |
1228 KB |
Output is correct |
| 2 |
Correct |
342 ms |
2136 KB |
Output is correct |
| 3 |
Correct |
38 ms |
860 KB |
Output is correct |
| 4 |
Correct |
322 ms |
2140 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
381 ms |
5176 KB |
Output is correct |
| 2 |
Correct |
567 ms |
6780 KB |
Output is correct |
| 3 |
Correct |
86 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
200 ms |
6648 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
479 ms |
5772 KB |
Output is correct |
| 2 |
Correct |
582 ms |
6136 KB |
Output is correct |
| 3 |
Correct |
248 ms |
6916 KB |
Output is correct |
| 4 |
Correct |
83 ms |
1892 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
442 ms |
6172 KB |
Output is correct |
| 2 |
Correct |
462 ms |
7776 KB |
Output is correct |
| 3 |
Correct |
251 ms |
7628 KB |
Output is correct |
| 4 |
Correct |
83 ms |
1884 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
612 ms |
6628 KB |
Output is correct |
| 2 |
Correct |
587 ms |
5864 KB |
Output is correct |
| 3 |
Correct |
96 ms |
8072 KB |
Output is correct |
| 4 |
Correct |
525 ms |
7860 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
560 ms |
6584 KB |
Output is correct |
| 2 |
Correct |
642 ms |
8112 KB |
Output is correct |
| 3 |
Correct |
963 ms |
9188 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
644 ms |
7756 KB |
Output is correct |
