Submission #1013709

#TimeUsernameProblemLanguageResultExecution timeMemory
1013709vjudge1Dancing Elephants (IOI11_elephants)C++17
26 / 100
9049 ms14672 KiB
#include "elephants.h" #include<bits/stdc++.h> #pragma GCC optimize(2) using namespace std; int n,l; int arr[50100]; set<int>st; void init(int N, int L, int X[]){ n = N; l=L; for(int i=0;i<N;i++) st.insert(arr[i]=X[i]); } int update(int i, int y) { st.erase(arr[i]); st.insert(arr[i]=y); int ans=0,lst=-1e9; for(auto b:st) if(lst+l<b) lst=b,ans++; 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...