Submission #59952

#TimeUsernameProblemLanguageResultExecution timeMemory
59952theknife2001Dancing Elephants (IOI11_elephants)C++17
0 / 100
2 ms248 KiB
int n; int ind[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; int cnt=1; int last=ind[0]; for(int i=1;i<n;i++) { if(last+l<ind[i]) { cnt++; last=ind[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...