제출 #412176

#제출 시각아이디문제언어결과실행 시간메모리
412176A_DDancing Elephants (IOI11_elephants)C++14
26 / 100
9060 ms2096 KiB
#include "elephants.h" #include <bits/stdc++.h> #define LL long long using namespace std; LL n,l; vector<LL> vec; vector<LL> vec2; void init(int N, int L, int X[]) { n=N; l=L; for(int i=0;i<N;i++){ vec.push_back(X[i]); } } int update(int i, int y) { vec2.clear(); vec[i]=y; for(auto x:vec)vec2.push_back(x); sort(vec2.begin(),vec2.end()); LL ans=0,r=-1; for(auto x:vec2){ if(r<x){ r=x+l; 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...