Submission #115168

#TimeUsernameProblemLanguageResultExecution timeMemory
115168songcDancing Elephants (IOI11_elephants)C++14
26 / 100
9044 ms2944 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int N, L; int A[101010]; multiset<int> S; void init(int n, int l, int X[]) { N=n, L=l; for (int i=0; i<N; i++){ A[i] = X[i]; S.insert(X[i]); } } int update(int i, int y) { S.erase(S.find(A[i])); A[i] = y; S.insert(y); int ans=0, k=-1234567890; for (int it : S) if (k+L < it) ans++, k=it; return ans; }
#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...