Submission #249800

#	Time	Username	Problem	Language	Result	Execution time	Memory
249800		eohomegrownapps	Dancing Elephants (IOI11_elephants)	C++14	10 / 100	0 ms	384 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
#include <bits/extc++.h>
using namespace __gnu_pbds;
template <typename T>
using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T, typename V>
using pbds_map = tree<T, V, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
int n,l;
pbds_set<int> elephants;
vector<int> elpos;
vector<int> dp;
 
void init(int N, int L, int X[]) {
    n=N;l=L;
    elpos.resize(n);
    dp.resize(n);
    for (int i = 0; i<n; i++){
        elpos[i]=X[i];
        elephants.insert(X[i]);
    }
}
 
int update(int i, int y) {
    if (l==0){
        return n;
    }
    int minchanged = min(elpos[i],y);
    //cout<<minchanged<<'\n';
    elephants.erase(elpos[i]);
    elpos[i]=y;
    elephants.insert(y);
    auto it = elephants.lower_bound(minchanged-10*l);
    if (it!=elephants.begin()){
        it--;
    }
    if (it!=elephants.begin()){
        it--;
    }
    //auto it = elephants.begin();
    int ptr = int(elephants.order_of_key(*it));
    //cout<<ptr<<'\n';
    while (it!=elephants.end()){
        int e = *it;
        //cout<<e<<'\n';
        int lastel = elephants.order_of_key(e-l);
        if (lastel==0){
            dp[ptr]=1;
        } else {
            dp[ptr]=dp[lastel-1]+1;
        }
        ptr++;
        it++;
    }
    return dp[n-1];
}

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