Submission #874426

#TimeUsernameProblemLanguageResultExecution timeMemory
87442612345678Dancing Elephants (IOI11_elephants)C++17
26 / 100
9023 ms14588 KiB
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=150005;

int n, l, v[nx];
multiset<int> ms;

void init(int N, int L, int X[])
{
    n=N; l=L;
    for (int i=0; i<N; i++) v[i]=X[i], ms.emplace(X[i]);
}

int update(int i, int y)
{
    ms.erase(ms.find(v[i]));
    v[i]=y;
    ms.insert(v[i]);
    int tmp=INT_MIN, cnt=0;
    for (auto x:ms) if (x>tmp) cnt++, tmp=x+l;
    return cnt;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...