제출 #941500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941500		tamir1	Growing Trees (BOI11_grow)	C++17	10 / 100	1070 ms	2132 KiB

grow

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,i,c,h,l,r,a[100005],ans;
char type;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for(i=1;i<=n;i++){
		cin >> a[i];
	}
	sort(a+1,a+n+1);
	while(m--){
		cin >> type;
		if(type=='F'){
			cin >> c >> h;
			for(i=1;i<=n;i++){
				if(a[i]>=h && c>0){
					a[i]++;
					c--;
				}
			}
			sort(a+1,a+n+1);
		}
		else{
			cin >> l >> r;
			ans=0;
			for(i=1;i<=n;i++){
				if(a[i]>=l && a[i]<=r) ans++;
			}
			cout << ans << "\n";
		}
	}
}

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