Submission #877157

#TimeUsernameProblemLanguageResultExecution timeMemory
877157MatjazDancing Elephants (IOI11_elephants)C++14
26 / 100
9024 ms8284 KiB
#include "elephants.h"
#include <set>
#include <vector>
#include <algorithm>


using namespace std;

int N,L;
set<int> E;
vector<int> x;

void init(int _N, int _L, int X[]){
    N = _N;
    L = _L;
    E.insert(X, X+N);
    x.assign(X, X+N);
}

int update(int i, int y){
    E.erase(x[i]);
    E.insert(y);
    x[i] = y;
    set<int>::iterator it = E.begin();
    int count = 0;
    while (it != E.end()){
        count++;
        it = E.upper_bound(*it + L);
    }
    return count;
}
#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...