Submission #1093959

#	Time	Username	Problem	Language	Result	Execution time	Memory
1093959		Aviansh	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	50 / 100	9064 ms	1752 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"

using namespace std;

int n;
int l;
int *x;
unordered_map<int,int>mp;
vector<int>uni;

void init(int N, int L, int X[])
{
    n = N;
    l=L;
    x=X;
    for(int i = 0;i<n;i++){
        uni.push_back(x[i]);
    }
    sort(uni.begin(),uni.end());
}

int update(int i, int y)
{
    uni.erase(lower_bound(uni.begin(),uni.end(),x[i]));
    x[i]=y;
    int ind = lower_bound(uni.begin(),uni.end(),x[i])-uni.begin();
    uni.insert(uni.begin()+ind,x[i]);
    int ans = 1;
    int las = uni[0];
    for(int i : uni){
        if(i-las>l){
            las=i;
            ans++;
        }
    }
    return ans;
}

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