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"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int n,l;
vi s;
const int K = 1000;
const int oo = 2e9 + 5;
const int NN = 1e6 + 5;
int Step = 0;
multiset < int > ss;
vi v[NN];
vi dp1[NN];
vi dp2[NN];
int SZ;
void build_block(int w) {
int sz = v[w].size();
int index = sz;
dp1[w].resize(sz);
dp2[w].resize(sz);
for (int j = sz - 1;j >= 0;--j) {
while (v[w][j] + l < v[w][index - 1])
--index;
dp1[w][j] = 1;
dp2[w][j] = v[w][j];
if (index < sz)
dp1[w][j] += dp1[w][index],dp2[w][j] = dp2[w][index];
}
}
void del(int val) {
for (int i = 0;i < SZ;++i)
if (!v[i].empty() && v[i][0] <= val && val <= v[i].back()) {
vi nw;
for (auto it : v[i])
if (it != val)
nw.pb(it);
else
val = oo;
assert(nw.size() + 1 == v[i].size());
v[i] = nw;
build_block(i);
break;
}
}
void add(int val) {
int pr = SZ - 1;
for (int i = 0;i < SZ;++i)
if (!v[i].empty() && val <= v[i].back()) {
pr = i;
break;
}
vi nw;
for (auto it : v[pr]) {
if (it > val)
nw.pb(val),val = oo;
nw.pb(it);
}
if (val != oo)
nw.pb(val);
v[pr] = nw;
build_block(pr);
}
void build(void) {
int index = -1;
SZ = (ss.size() + K - 1) / K;
for (int i = 0;i < SZ;++i)
v[i].clear(),dp1[i].clear(),dp2[i].clear();
for (auto it : ss) {
++index;
v[index / K].pb(it);
}
for (int i = 0;i < SZ;++i) {
build_block(i);
}
}
void init(int N, int L, int X[]) {
n = N;
l = L;
for (int i = 0;i < n;++i)
s.pb(X[i]),ss.insert(X[i]);
}
int update(int i, int y) {
if (!(Step % K)) {
build();
}
++Step;
ss.erase(ss.find(s[i]));
del(s[i]);
ss.insert(y);
add(s[i] = y);
int prev = -oo;
int ans = 0;
for (int i = 0;i < SZ;++i) {
if (v[i].empty())
continue;
int low = lower_bound(all(v[i]),prev) - v[i].begin();
if (low != v[i].size()) {
ans += dp1[i][low];
prev = dp2[i][low] + l + 1;
}
}
return ans;
}
Compilation message (stderr)
elephants.cpp: In function 'int update(int, int)':
elephants.cpp:125:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (low != v[i].size()) {
~~~~^~~~~~~~~~~~~~
# | 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... |