Submission #59959

#TimeUsernameProblemLanguageResultExecution timeMemory
59959theknife2001Dancing Elephants (IOI11_elephants)C++17
26 / 100
9007 ms2212 KiB
#include <bits/stdc++.h> #include "elephants.h" using namespace std; int n; int ind[50005]; int ind1[50005]; int l; void init(int N, int L, int X[]) { for(int i=0;i<N;i++) ind[i]=X[i]; l=L; n=N; } int update(int i, int y) { ind[i]=y; for(int i=0;i<n;i++) ind1[i]=ind[i]; sort(ind1,ind1+n); int cnt=1; int last=ind1[0]; for(int i=1;i<n;i++) { if(last+l<ind1[i]) { cnt++; last=ind1[i]; } } return cnt; }
#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...