Submission #834786

#	Time	Username	Problem	Language	Result	Execution time	Memory
834786		mat_jur	Growing Trees (BOI11_grow)	C++17	0 / 100	30 ms	8428 KiB

grow

#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
auto&operator<<(auto &o, pair<auto, auto> p) {o << "(" << p.first << "," << p.second << ")"; return o;}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";for(auto e:x)o<< e << ", ";return o<<"}";}
#define debug(X) cerr << "["#X"]:" << X << '\n';
#else 
#define debug(X) ;
#endif
#define ll long long

int main () {
	int n, q;
	cin >> n >> q;
	vector<int> cnt(1000000);
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		cnt[a]++;
	}
	while (q--) {
		char c;
		cin >> c;
		if (c == 'F') {
			int c, h;
			cin >> c >> h;
			int y = 0;
			while (c > 0) {
				int x = min(cnt[h], c);
				cnt[h] += y;
				cnt[h] -= x;
				y = x;
				c -= x;
				h++;
			}
			cnt[h] += y;
		}
		else {
			int res = 0;
			int l, r;
			cin >> l >> r;
			for (int i = l; i <= r; i++) {
				res += cnt[i];
			}
			cout << res << '\n';
		}
	}

	return 0;
}

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