제출 #520491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520491		blue	Growing Trees (BOI11_grow)	C++17	20 / 100	1090 ms	1244 KiB

grow

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using vi = vector<int>;
using ll = long long;
using vll = vector<ll>;

const int mx = 100'000;

const int Z = (1<<17);


int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int N, M;

	cin >> N >> M;

	vll h(N);
	for(int i = 0; i < N; i++) cin >> h[i];

	for(int j = 0; j < M; j++)
	{
		char c;
		cin >> c;

		if(c == 'C')
		{
			int mn, mx;
			cin >> mn >> mx;
			int res = 0;
			for(int i = 0; i < N; i++) res += (mn <= h[i] && h[i] <= mx);
				cout << res << '\n';
		}
		else
		{
			int c, ht;
			cin >> c >> ht;

			sort(h.begin(), h.end());

			int st = 0;
			while(st < N && h[st] < ht) st++;

			for(int j = st; j < N && j-st+1 <= c; j++)
				h[j]++;
		}
	}
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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