oj.uz

Submission #1037016

# Submission time Handle Problem Language Result Execution time Memory
1037016 2024-07-27T21:57:00 Z xjonwang Growing Trees (BOI11_grow) C++17
100 / 100
 125 ms 3452 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
	return to_string(x.first) + ' ' + to_string(x.second);
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

struct FT {
	int n; vt<int> v;
	FT(int a) : n(a), v(n, 0) {}
	void modify(int i, int x) {
		for (; i<n; i|=i+1) v[i]+=x;
	}
	int query(int i) {
		int ret=0;
		for (; i>0; i&=i-1) ret+=v[i-1];
		return ret;
	}
};

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m, x, y, lb, ub, l, r, d; read(n, m);
	vt<int> v(n); read(v);
	sort(all(v));
	FT ft(n+1);
	auto lbc=[&](int i) { return v[i]+ft.query(i+1)>=lb; };
	auto ubc=[&](int i) { return v[i]+ft.query(i+1)>ub; };
	char a;
	FOR(m) {
		read(a);
		switch (a) {
			case 'F':
				read(x, y);
				lb=y, l=FIRSTTRUE(lbc, 0, n);
				if (l+x>=n) {
					ft.modify(l, 1);
					continue;
				}
				lb=v[l+x-1]+ft.query(l+x), d=FIRSTTRUE(lbc, 0, n);
				ub=lb, r=FIRSTTRUE(ubc, 0, n);
				ft.modify(l, 1);
				ft.modify(d, -1);
				ft.modify(r-(x-(d-l)), 1);
				ft.modify(r, -1);
				break;
			case 'C':
				read(x, y); lb=x, ub=y;
				r=FIRSTTRUE(ubc, 0, n), l=FIRSTTRUE(lbc, 0, n);
				print(FIRSTTRUE(ubc, 0, n)-FIRSTTRUE(lbc, 0, n));
				break;
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 2384 KB Output is correct
2 Correct 105 ms 2896 KB Output is correct
3 Correct 29 ms 2764 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 62 ms 1412 KB Output is correct
6 Correct 88 ms 1696 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 32 ms 1112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1688 KB Output is correct
2 Correct 78 ms 1876 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 49 ms 1364 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1872 KB Output is correct
2 Correct 71 ms 1620 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 71 ms 1856 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2060 KB Output is correct
2 Correct 97 ms 2292 KB Output is correct
3 Correct 20 ms 856 KB Output is correct
4 Correct 39 ms 2396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 2128 KB Output is correct
2 Correct 101 ms 2404 KB Output is correct
3 Correct 37 ms 2644 KB Output is correct
4 Correct 22 ms 856 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2096 KB Output is correct
2 Correct 64 ms 2460 KB Output is correct
3 Correct 48 ms 2676 KB Output is correct
4 Correct 19 ms 856 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 2644 KB Output is correct
2 Correct 102 ms 2416 KB Output is correct
3 Correct 30 ms 1880 KB Output is correct
4 Correct 49 ms 2384 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 2644 KB Output is correct
2 Correct 98 ms 2640 KB Output is correct
3 Correct 97 ms 2880 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 3452 KB Output is correct