제출 #116610

#제출 시각아이디문제언어결과실행 시간메모리
116610dragonslayerit코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9051 ms2176 KiB
#include "elephants.h" #include <vector> #include <algorithm> const int INF=1e9+7; std::vector<int> xs; int l; void init(int N, int L, int X[]) { l=L; for(int i=0;i<N;i++){ xs.push_back(X[i]); } } int update(int i, int y) { xs[i]=y; std::vector<int> ys(xs); std::sort(ys.begin(),ys.end()); int far=-INF; int cnt=0; for(int x:ys){ if(x>far){ far=x+l; 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...