167 lines
3.7 KiB
C++
167 lines
3.7 KiB
C++
/* Problem URL: https://cses.fi/problemset/task/2206 */
|
|
|
|
#include <bits/stdc++.h>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
|
|
using namespace std;
|
|
using namespace __gnu_pbds;
|
|
|
|
template <class T, class comp = less<>>
|
|
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (int i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int n, q;
|
|
cin >> n >> q;
|
|
|
|
vl fds(n);
|
|
cin >> fds;
|
|
|
|
ll oo = INT64_MAX >> 1;
|
|
|
|
while (__builtin_popcount(n) != 1) {
|
|
n++;
|
|
fds.push_back(oo);
|
|
}
|
|
|
|
vl segpref(n * 2);
|
|
vl segsuf(n * 2);
|
|
|
|
rep(i, n) {
|
|
segpref[i + n] = fds[i] + i;
|
|
segsuf[i + n] = fds[i] + (n - i - 1);
|
|
}
|
|
|
|
for (int i = n - 1; i > 0; i--) {
|
|
segpref[i] = min(segpref[i * 2], segpref[i * 2 + 1]);
|
|
segsuf[i] = min(segsuf[i * 2], segsuf[i * 2 + 1]);
|
|
}
|
|
|
|
auto update = [&](int i, ll v) {
|
|
i += n;
|
|
segpref[i] = v + (i - n);
|
|
segsuf[i] = v + (2 * n - i - 1);
|
|
|
|
for (i >>= 1; i > 0; i >>= 1) {
|
|
segpref[i] = min(segpref[i * 2], segpref[i * 2 + 1]);
|
|
segsuf[i] = min(segsuf[i * 2], segsuf[i * 2 + 1]);
|
|
}
|
|
};
|
|
|
|
function<ll(int, int, int, int, int)> querypref = [&](int i, int l, int r, int tl, int tr) {
|
|
if (l > tr || r < tl) {
|
|
return oo;
|
|
}
|
|
|
|
if (l >= tl && r <= tr) {
|
|
return segpref[i];
|
|
}
|
|
|
|
int mid = (l + r) >> 1;
|
|
|
|
return min(querypref(i * 2, l, mid, tl, tr), querypref(i * 2 + 1, mid + 1, r, tl, tr));
|
|
};
|
|
|
|
function<ll(int, int, int, int, int)> querysuf = [&](int i, int l, int r, int tl, int tr) {
|
|
if (l > tr || r < tl) {
|
|
return oo;
|
|
}
|
|
|
|
if (l >= tl && r <= tr) {
|
|
return segsuf[i];
|
|
}
|
|
|
|
int mid = (l + r) >> 1;
|
|
|
|
return min(querysuf(i * 2, l, mid, tl, tr), querysuf(i * 2 + 1, mid + 1, r, tl, tr));
|
|
};
|
|
|
|
while (q--) {
|
|
int op;
|
|
cin >> op;
|
|
|
|
if (op == 1) {
|
|
int k, x;
|
|
cin >> k >> x;
|
|
|
|
update(k - 1, x);
|
|
continue;
|
|
}
|
|
|
|
int k;
|
|
cin >> k;
|
|
k--;
|
|
|
|
cout << min({querypref(1, 0, n - 1, k, n - 1) - k, querysuf(1, 0, n - 1, 0, k) - (n - k - 1)}) << '\n';
|
|
}
|
|
}
|