Submission #1192554

#TimeUsernameProblemLanguageResultExecution timeMemory
1192554aren_danceDancing Elephants (IOI11_elephants)C++20
26 / 100
9089 ms3652 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n; int x[50001]; int l; set<int> st; void init(int N, int L, int X[]) { n=N; l=L; for(int i=0;i<n;++i){ x[i]=X[i]; st.insert(x[i]); } } int update(int id, int nx) { int cnt=1; st.erase(x[id]); x[id]=nx; st.insert(x[id]); int her=*st.begin()+l; for(auto i=st.begin();i!=st.end();++i){ if(*i>her){ ++cnt; her=*i+l; } } 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...