제출 #846954

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
846954		vjudge1	Growing Trees (BOI11_grow)	C++17	0 / 100	746 ms	1360 KiB

grow

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
int n, m, x, y, z, zz, a[N];
char t;
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    a[0] = 1e9;
    sort (a + 1, a + n + 1);
    while (m--)
    {
        cin >> t >> x >> y;
        if (t == 'F')
        {
            int i = 1;
            while (x > 0 && i <= n)
            {
                z = upper_bound (a + i, a + n + 1, y) - a - 1;
                i = z + 1;
                while (z > 0 && a[z] >= y && x > 0)
                {
                    a[z]++;
                    z--;
                    x--;
                }
                y = a[i];
                if (a[z] < y)
                {
                    break;
                }
            }
        }
        else
        {
            z = lower_bound (a + 1, a + n + 1, x) - a;
            zz = upper_bound (a + 1, a + n + 1, y) - a;
            cout << zz - z << "\n";
        }
    }
}

• 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