Submission #380311

#TimeUsernameProblemLanguageResultExecution timeMemory
380311MilosMilutinovicDancing Elephants (IOI11_elephants)C++14
26 / 100
9032 ms2028 KiB
#include <bits/stdc++.h> using namespace std; const int mxN=1.5e5; int n, l, a[mxN], b[mxN]; int update(int pos, int y) { a[pos]=y; for(int i=0; i<n; ++i) b[i]=a[i]; sort(b,b+n); int ans=1, j=0; for(int i=0; i<n; ++i) { if((b[i]-b[j])>l) j=i, ++ans; } return ans; } void init(int N, int L, int* X) { n=N, l=L; for(int i=0; i<n; ++i) a[i]=X[i]; }
#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...