제출 #1122141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122141		vjudge1	Growing Trees (BOI11_grow)	C++14	30 / 100	1057 ms	1868 KiB

grow

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;

const ll mod = 1e9 + 7;
const int N = 1e5 + 5;

int n, q;
int val[100005];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin >> n >> q;
	
	for (int i = 1; i <= n; i ++ )
		cin >> val[i];

	sort(val + 1, val + n + 1);
	
	while (q -- ){
		char type;
		int a, b;
		cin >> type >> a >> b;
		
		if (type == 'F'){
			int pos = lower_bound(val + 1, val + n + 1, b) - val;
			
			for (int i = pos; i <= min(n, pos + a - 1); i ++ )
				val[i] ++;
			sort(val + 1, val + n + 1);
		}
		else {
			int pos1 = upper_bound(val + 1, val + n + 1, b) - val;
			int pos2 = lower_bound(val + 1, val + n + 1, a) - val;
			
			cout << pos1 - pos2 <<endl;
		}
		
		
	}
	

}

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