Submission #1036942

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036942		aaaaaarroz	Dancing Elephants (IOI11_elephants)	C++17	50 / 100	9076 ms	3500 KiB

elephants

#include "elephants.h"
    #include<bits/stdc++.h>
    using namespace std;
    #pragma GCC optimize(2)
    int n,l;
    int arr[50100],st[50100];
    void init(int N, int L, int X[]){
        n = N;
        l=L;
        for(int i=0;i<N;i++)
            st[i]=arr[i]=X[i];
    }
    int update(int i, int y) {
        if(!l)return n;
        int ans=0,lst=-1e9;
        int p=lower_bound(st,st+n,arr[i])-st;
        while(p<n-1&&y>st[p+1])st[p]=st[p+1],p++;
        while(p&&y<st[p-1])st[p]=st[p-1],p--;
        st[p]=arr[i]=y;
        for(int b=0;b<n;b++)
            if(lst+l<st[b])
                lst=st[b],ans++;
        return ans;
    }

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3