제출 #578275

#제출 시각아이디문제언어결과실행 시간메모리
578275Dan4LifeDancing Elephants (IOI11_elephants)C++17
0 / 100
1 ms468 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n, pos[70010], l; multiset<int> S; void init(int N, int L, int X[]) { n = N; l = L; for(int i = 0; i < n; i++) pos[i] = X[i], S.insert(X[i]); } int update(int i, int y) { S.erase(S.find(pos[i])); S.insert(y); int cur = *S.begin(), cnt = 1; for(auto u : S) if(cur+l<u) cur = u, cnt++; 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...