제출 #807326

#제출 시각아이디문제언어결과실행 시간메모리
807326TheSahib코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9065 ms2440 KiB
#pragma GCC optimize("O3") #include "elephants.h" #include <bits/stdc++.h> using namespace std; int n, l; multiset<int> st; int arr[150005]; void init(int N, int L, int X[]) { n = N; l = L; for (int i = 0; i < N; i++) { st.insert(X[i]); arr[i] = X[i]; } } int update(int i, int y) { st.erase(st.find(arr[i])); arr[i] = y; st.insert(arr[i]); int ans = 0; auto itr = st.begin(); while(true){ ans += 1; int a = *itr; itr = st.upper_bound(a + l); if(itr == st.end()) break; } 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...