# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671765 | Hacv16 | Dancing Elephants (IOI11_elephants) | C++17 | 0 ms | 0 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<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
const int MAX = 2e6 + 15;
int n, l, pos[MAX];
vector<int> x;
void init(int n_, int l_, int x_[]){
n = n_, l = l_;
x.resize(n);
for(int i = 0; i < n; i++)
x[i] = x_[i], pos[i] = x[i];
}
vector<int> Merge(vector<int>& x, vector<int>& y, vector<int>& z){
vector<int> aux(sz(x) + sz(y)), ret(sz(x) + sz(y) + sz(z));
merge(all(x), all(y), aux.begin());
merge(all(aux), all(z), ret.begin());
return ret;
}
int update(int i, int y){
vector<int> a, b, c;
int id = 0;
while(x[id] < pos[i]) id++;
for(int j = 0; j < id; j++)
a.push_back(x[j]);
for(int j = id + 1; j < n; j++)
b.push_back(x[j]);
c.push_back(y);
vector<int> aux = Merge(a, b, c);
swap(aux, x);
int ans = 0, r = -1;
for(int j = 0; j < n; j++)
if(x[j] > r) ans++, r = x[j] + l;
pos[i] = y;
return ans;
}
int main(){
init(4, 10, X);
cout << update(2, 16) << '\n';
cout << update(1, 25) << '\n';
cout << update(3, 35) << '\n';
cout << update(0, 38) << '\n';
cout << update(2, 0) << '\n';
return 0;
}