# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116612 | dragonslayerit | Dancing Elephants (IOI11_elephants) | C++14 | 9073 ms | 3196 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "elephants.h"
#include <vector>
#include <algorithm>
const int INF=1e9+7;
std::vector<int> xs;
std::vector<int> ys;
int l;
void init(int N, int L, int X[])
{
l=L;
for(int i=0;i<N;i++){
xs.push_back(X[i]);
}
ys=xs;
}
int update(int i, int new_val)
{
for(int& y:ys){
if(y==xs[i]){
y=new_val;
break;
}
}
xs[i]=new_val;
//std::sort(ys.begin(),ys.end());
for(int i=0;i<ys.size();i++){
int tmp=ys[i];
int j=i;
while(j>0&&ys[j-1]>tmp){
ys[j]=ys[j-1];
j--;
}
ys[j]=tmp;
}
int far=-INF;
int cnt=0;
for(int x:ys){
if(x>far){
far=x+l;
cnt++;
}
}
return cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |