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 <bits/stdc++.h>
#include "elephants.h"
//~ #include "grader.cpp"
using namespace std;
int n, l;
vector <int> a;
void init(int N, int L, int X[]){
n = N;
l = L;
for(int i = 0 ; i < n ; i++){
a.push_back(X[i]);
}
}
int update(int i, int y){
a.erase(a.begin() + i);
for(int i = 0 ; i < (int)a.size() ; i++){
if(a[i] > y){
a.insert(a.begin() + i, y);
break;
}
}
if((int)a.size() != n) a.push_back(y);
int cur = a[0];
int ans = 1;
for(auto &i : a){
if(cur + l < i){
cur = i;
ans++;
}
}
return ans;
}
# | 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... |