Submission #269553

#TimeUsernameProblemLanguageResultExecution timeMemory
269553AutoratchDancing Elephants (IOI11_elephants)C++14
26 / 100
26 ms3328 KiB
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

int n,l;
set<int> s;
int a[101];

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

int update(int i, int y)
{
    s.erase(a[i]);
    a[i] = y;
    s.insert(a[i]);
    int now = *(s.begin()),used = 1;
    for(int x : s)
    {
        if(now+l>=x) continue;
        now = x,used++;
    }
    return used;
}
#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...