Submission #65187

#	Time	Username	Problem	Language	Result	Execution time	Memory
65187		qkxwsm	Growing Trees (BOI11_grow)	C++17	100 / 100	239 ms	39020 KiB

grow

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, Q;
int arr[MAXN];
ll fen[MAXN];

void upd(int idx, ll val)
{
        for (int e = idx + 1; e <= N; e += e & (-e))
        {
                fen[e] += val;
        }
        return;
}
ll get(int idx)
{
        ll res = 0;
        for (int e = idx + 1; e; e -= e & (-e))
        {
                res += fen[e];
        }
        return res;
}
void update(int l, int r, ll val)
{
        upd(l, val);
        upd(r + 1, -val);
}
int lowerbound(ll val)
{
        //smallest guy >= val
        //so this counts # of guys <val
        int res = 0;
        for (int i = 20; i >= 0; i--)
        {
                if (res + (1 << i) <= N && fen[res + (1 << i)] < val)
                {
                        res += (1 << i);
                        val -= fen[res];
                }
        }
        return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
        cin >> N >> Q;
        for (int i = 0; i < N; i++)
        {
                cin >> arr[i];
        }
        sort(arr, arr + N);
        for (int i = 0; i < N; i++)
        {
                update(i, i, arr[i]);
        }
        while(Q--)
        {
                char qid;
                cin >> qid;
                if (qid == 'F')
                {
                        int freq; ll val;
                        cin >> freq >> val;
                        int idx = lowerbound(val);
                        if (idx + freq >= N)
                        {
                                update(idx, N - 1, 1);
                                continue;
                        }
                        //else you would want to update idx...idx + freq - 1
                        int cap = get(idx + freq - 1);
                        int hi = lowerbound(cap + 1);
                        int lo = lowerbound(cap);
                        update(idx, lo - 1, 1);
                        //lo...idx + freq - 1 has same as x...hi - 1 -> hi - x = idx + freq - lo -> x = hi - idx - freq + lo
                        update(hi + lo - idx - freq, hi - 1, 1);
                }
                if (qid == 'C')
                {
                        ll lo, hi;
                        cin >> lo >> hi;
                        cout << lowerbound(hi + 1) - lowerbound(lo) << '\n';
                }
        }
        //update a range by a avlue,
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message (stderr)

grow.cpp: In function 'int32_t main()':
grow.cpp:193:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:194:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10