Submission #578276

#TimeUsernameProblemLanguageResultExecution timeMemory
578276Dan4Life코끼리 (Dancing Elephants) (IOI11_elephants)C++17
26 / 100
9047 ms5200 KiB
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n, pos[70010], l;
multiset<int> S;

void init(int N, int L, int X[])
{
    n = N; l = L;
    for(int i = 0; i < n; i++)
        pos[i] = X[i], S.insert(X[i]);
}

int update(int i, int y)
{
    S.erase(S.find(pos[i]));
    S.insert(y); pos[i]=y;
    int cur = *S.begin(), cnt = 1;
    for(auto u : S)
        if(cur+l<u) cur = u, cnt++;
    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...