oj.uz

Submission #549945

# Submission time Handle Problem Language Result Execution time Memory
549945 2022-04-16T22:36:28 Z Bungmint Growing Trees (BOI11_grow) C++17
100 / 100
 104 ms 3404 KB 
//Copyright © 2022 Youngmin Park. All rights reserved.
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define REP(a) F0R(_, a)

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
const ld PI = acos((ld)-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

inline namespace RecursiveLambda{
	template <typename Fun>
	struct y_combinator_result{
		Fun fun_;
		template <typename T> 
		explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){}
		template <typename...Args>
		decltype(auto) operator()(Args &&...args){
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun){
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};

void setIO(string s) // USACO
{
	#ifndef LOCAL
	    freopen((s + ".in").c_str(), "r", stdin);
	    freopen((s + ".out").c_str(), "w", stdout);
	#endif
}

const int N = 1e5 + 10;
int n, m;
int b[N], h[N];

void upd(int i, int v, int t[]) {
	for (; i <= n; i += i & -i) t[i] += v;
}
int q(int r, int t[]) {
	int ret{};
	for (; r; r -= r & -r) ret += t[r];
	return ret;
}
void range_upd(int l, int r, int v) {
	upd(l, v, b);
	upd(r + 1, -v, b);
}
int query(ll r) {
	return q(r, b);
}
int lower_bound(int H) {
	int l = 1, r = n, res = n + 1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (query(mid) >= H) res = mid, r = mid - 1;
		else l = mid + 1;
	}
	return res;
}
#define left ajefoiewjfojwepfioajpeow
#define right aoiewjfoiewjfo
int left(int i) {
	int targ = query(i);
	int l = 1, r = i, res = i;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (query(m) == targ) res = m, r = m - 1;
		else l = m + 1;
	}
	return res;
}
int right(int i) {
	int targ = query(i);
	int l = i, r = n, res = i;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (query(m) == targ) res = m, l = m + 1;
		else r = m - 1;
	}
	return res;
}

void solve()
{
	cin >> n >> m;
	FOR(i, 1, n + 1) cin >> h[i];
	sort(h + 1, h + n + 1);
	FOR(i, 1, n + 1) range_upd(i, i, h[i]);
	dbg(query(5));
	REP(m) {
		char c;
		cin >> c;
		if (c == 'F') {
			int cnt, hh;
			cin >> cnt >> hh;
			int l = lower_bound(hh);
			if (l == n + 1) continue;
			int r = min(l + cnt - 1, n);
			int nl = left(r);
			int nr = right(r);
			range_upd(l, nl - 1, 1);
			range_upd(nl + nr - r, nr, 1);
		}else{
			int a, b;
			cin >> a >> b;
			int l = lower_bound(a), r = lower_bound(b + 1) - 1;
			cout << r - l + 1 << '\n';
		}
	}
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

grow.cpp: In function 'void solve()':
grow.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
grow.cpp:156:2: note: in expansion of macro 'dbg'
  156 |  dbg(query(5));
      |  ^~~
grow.cpp: In function 'void setIO(std::string)':
grow.cpp:94:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:95:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 2284 KB Output is correct
2 Correct 97 ms 2696 KB Output is correct
3 Correct 46 ms 2616 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 44 ms 1340 KB Output is correct
6 Correct 51 ms 1556 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 27 ms 1140 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 1624 KB Output is correct
2 Correct 67 ms 1744 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 33 ms 1344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1908 KB Output is correct
2 Correct 73 ms 1636 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 57 ms 1668 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1976 KB Output is correct
2 Correct 90 ms 2252 KB Output is correct
3 Correct 16 ms 860 KB Output is correct
4 Correct 44 ms 2220 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1980 KB Output is correct
2 Correct 90 ms 2356 KB Output is correct
3 Correct 48 ms 2524 KB Output is correct
4 Correct 16 ms 800 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 2128 KB Output is correct
2 Correct 76 ms 2288 KB Output is correct
3 Correct 71 ms 2544 KB Output is correct
4 Correct 17 ms 852 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 2744 KB Output is correct
2 Correct 99 ms 2272 KB Output is correct
3 Correct 28 ms 1728 KB Output is correct
4 Correct 64 ms 2088 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 2512 KB Output is correct
2 Correct 100 ms 2652 KB Output is correct
3 Correct 104 ms 2888 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 3404 KB Output is correct