제출 #931461

#제출 시각아이디문제언어결과실행 시간메모리
931461mohammedMonem코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9039 ms10160 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n, l; vector<int> x; multiset<int> poss; void init(int N, int L, int X[]) { n = N, l = L; for (int i = 0; i < N; ++i) { x.push_back(X[i]); poss.insert(X[i]); } } int update(int i, int y) { poss.erase(x[i]); x[i] = y; poss.insert(x[i]); int ans = 0; for (auto it = poss.begin(); it != poss.end(); ans++) { it = poss.upper_bound(*it + l); } 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...