Submission #1240228

#TimeUsernameProblemLanguageResultExecution timeMemory
1240228GabrielDancing Elephants (IOI11_elephants)C++20
26 / 100
9095 ms5700 KiB
#include "elephants.h" #include "bits/stdc++.h" using namespace std; int n, l; multiset<int> a; map<int, int> Mapa; void init(int N, int L, int X[]){ n = N; l = L; for(int i = 0; i < n; i++){ Mapa[i] = X[i]; a.insert(X[i]); } } int update(int i, int y){ a.erase(a.find(Mapa[i])); Mapa[i] = y; a.insert(y); int r = 0, p = -2; for(auto E: a){ if(p == -2){ r++; p = E; } else if(E > p + l){ r++; p = E; } } return r; }
#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...