Submission #1168722

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168722		son2008	Growing Trees (BOI11_grow)	C++20	100 / 100	75 ms	2376 KiB

grow

#include<bits/stdc++.h>
using namespace std;
#define task "task"
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 30
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define base 29
#define eps 1e-8
int dx[]= {0LL,0LL,1,-1,1,1,-1,-1};
int dy[]= {1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=4e5+1;
const int mod=1e9+7;
int n,q,a[maxn];
struct FEN
{
    int n;
    vector<int>bit;
    FEN(){};
    FEN(int _n):bit(n+1,0),n(_n+1)
    {
    };
    int get(int r) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    int get(int l, int r) {
        return get(r) - get(l - 1);
    }

    void update(int idx, int delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
    void updateRange(int l,int r,int val)
    {
        if(l>r)return;
        update(l,val);
        update(r+1,-val);
    }
}bit;
void init()
{
    cin>>n>>q;
    bit=FEN(n+1);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    {
        bit.update(i,a[i]-a[i-1]);
    }
}
void solve1()
{
    int c,h;
    cin>>c>>h;
    int l=1,r=n,ans=-1;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(bit.get(mid)>=h)
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    if(ans==-1)return;
    c=min(c,n-ans+1);
    int val=bit.get(ans+c-1);
    int L=ans+c-1,R=ans+c-1;
    l=ans+c-1,r=n;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(bit.get(mid)==val)
        {
            l=mid+1;
            R=mid;
        }
        else r=mid-1;
    }
    l=1,r=ans+c-1;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(bit.get(mid)==val)
        {
            r=mid-1;
            L=mid;
        }
        else l=mid+1;
    }
    bit.updateRange(ans,L-1,1);
    c-=L-ans;
    bit.updateRange(R-c+1,R,1);
}
void solve2()
{
    int mn,mx;
    cin>>mn>>mx;
    int l=1,r=n,L=-1,R=-1;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(bit.get(mid)>=mn)
        {
            r=mid-1;
            L=mid;
        }
        else l=mid+1;
    }
    if(L==-1)
    {
        cout<<0<<'\n';
        return;
    }
    l=L,r=n;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(bit.get(mid)<=mx)
        {
            l=mid+1;
            R=mid;
        }
        else r=mid-1;
    }
  //  cout<<L<<" "<<R<<'\n';
    if(R==-1)
    {
        cout<<0<<'\n';
        return;
    }
    cout<<R-L+1<<'\n';
}
void process()
{
    while(q--)
    {
        char t;
        cin>>t;
        if(t=='F')
            solve1();
        else solve2();
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if(fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    init();
    process();
    cerr <<endl<< "TIME : " << clock() * 0.001 << "s" << endl ;
}

Compilation message (stderr)

grow.cpp: In function 'int main()':
grow.cpp:167:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  167 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
grow.cpp:168:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  168 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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