Halc's Library
This documentation is automatically generated by online-judge-tools/verification-helper
Project maintained by halc-git Hosted on GitHub Pages — Theme by mattgraham
Verify/verify-yosupo-datastructure/predecessor_problem-segment_tree.test.cpp
- View this file on GitHub
- Last update: 2024-10-22 20:46:56+09:00
- Problem: https://judge.yosupo.jp/problem/predecessor_problem
Depends on
- Segment Tree
(DataStructure/SegmentTree.hpp)
- Template/InOut.hpp
- Template/Macro.hpp
- Template/Template.hpp
- Template/Util.hpp
Code
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#include "../../DataStructure/SegmentTree.hpp"
#include "../../Template/Template.hpp"
struct raq {
using T = ll;
static T op(T x, T y) { return x + y; }
static inline T e = 0;
};
void solve() {
LL(N, Q);
STR(T);
vec(ll, t, N, 0);
rep(i, N) {
if (T[i] == '1') t[i] = 1;
}
SegmentTree<raq> seg(t);
rep(i, Q) {
LL(c, k);
if (c == 0) {
if (!seg.get(k)) {
seg.set(k, 1);
}
}
if (c == 1) {
if (seg.get(k)) {
seg.set(k, 0);
}
}
if (c == 2) {
out(seg.get(k));
}
if (c == 3) {
ll ans = seg.max_right(k, [](ll x) { return x == 0; });
if (ans < N) {
out(ans);
} else {
out(-1);
}
}
if (c == 4) {
ll ans = seg.min_left(k + 1, [](ll x) { return x == 0; });
out(ans - 1);
}
}
}
int main() { solve(); }#line 1 "Verify/verify-yosupo-datastructure/predecessor_problem-segment_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#line 2 "DataStructure/SegmentTree.hpp"
#include <cstdint>
#include <queue>
#include <stack>
#include <vector>
template <class M>
struct SegmentTree {
using T = typename M::T;
int32_t siz;
std::vector<T> tree;
SegmentTree(int32_t sz) {
siz = sz;
tree = std::vector<T>(siz << 1, M::e);
}
SegmentTree(std::vector<T> def) {
siz = def.size();
tree = std::vector<T>(siz << 1, M::e);
for (int32_t i = 0; i < siz; i++) {
tree[i + siz] = def[i];
}
for (int32_t i = siz - 1; i > 0; i--) {
tree[i] = M::op(tree[i << 1], tree[(i << 1) + 1]);
}
}
void set(int32_t p, T v) {
p += siz;
tree[p] = v;
p >>= 1;
while (p > 0) {
tree[p] = M::op(tree[p << 1], tree[(p << 1) + 1]);
p >>= 1;
}
}
T get(int32_t p) { return tree[p + siz]; }
T prod(int32_t lf, int32_t ri) {
lf += siz;
ri += siz;
T rel = M::e;
T rer = M::e;
while (lf < ri) {
if (lf & 1) {
rel = M::op(rel, tree[lf]);
lf++;
}
if (ri & 1) {
ri--;
rer = M::op(tree[ri], rer);
}
lf >>= 1;
ri >>= 1;
}
return M::op(rel, rer);
}
int32_t max_right(int32_t lf, auto f) {
lf += siz;
int32_t ri = siz << 1;
std::queue<int32_t> lfp;
std::stack<int32_t> rip;
while (lf < ri) {
if (lf & 1) {
lfp.push(lf);
lf++;
}
if (ri & 1) {
ri--;
rip.push(ri);
}
lf >>= 1;
ri >>= 1;
}
T val = M::e;
while (!lfp.empty()) {
int32_t i = lfp.front();
lfp.pop();
if (!f(M::op(val, tree[i]))) {
while (i < siz) {
i <<= 1;
if (f(M::op(val, tree[i]))) {
val = M::op(val, tree[i]);
i++;
}
}
return i - siz;
}
val = M::op(val, tree[i]);
}
while (!rip.empty()) {
int32_t i = rip.top();
rip.pop();
if (!f(M::op(val, tree[i]))) {
while (i < siz) {
i <<= 1;
if (f(M::op(val, tree[i]))) {
val = M::op(val, tree[i]);
i++;
}
}
return i - siz;
}
val = M::op(val, tree[i]);
}
return siz;
}
int32_t min_left(int32_t ri, auto f) {
ri += siz;
int32_t lf = siz;
std::queue<int32_t> rip;
std::stack<int32_t> lfp;
while (lf < ri) {
if (lf & 1) {
lfp.push(lf);
lf++;
}
if (ri & 1) {
ri--;
rip.push(ri);
}
lf >>= 1;
ri >>= 1;
}
T val = M::e;
while (!rip.empty()) {
int32_t i = rip.front();
rip.pop();
if (!f(M::op(val, tree[i]))) {
while (i < siz) {
i <<= 1;
i++;
if (f(M::op(tree[i], val))) {
val = M::op(tree[i], val);
i--;
}
}
return i - siz + 1;
}
val = M::op(tree[i], val);
}
while (!lfp.empty()) {
int32_t i = lfp.top();
lfp.pop();
if (!f(M::op(val, tree[i]))) {
while (i < siz) {
i <<= 1;
i++;
if (f(M::op(tree[i], val))) {
val = M::op(tree[i], val);
i--;
}
}
return i - siz + 1;
}
val = M::op(tree[i], val);
}
return 0;
}
int32_t size() { return siz; }
};
#line 2 "Template/Template.hpp"
#include <bits/stdc++.h>
using namespace std;
#line 8 "Template/InOut.hpp"
inline void scan() {}
inline void scan(int32_t &a) { std::cin >> a; }
inline void scan(uint32_t &a) { std::cin >> a; }
inline void scan(int64_t &a) { std::cin >> a; }
inline void scan(uint64_t &a) { std::cin >> a; }
inline void scan(char &a) { std::cin >> a; }
inline void scan(float &a) { std::cin >> a; }
inline void scan(double &a) { std::cin >> a; }
inline void scan(long double &a) { std::cin >> a; }
inline void scan(std::vector<bool> &vec) {
for (int32_t i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(std::string &a) { std::cin >> a; }
template <class T>
inline void scan(std::vector<T> &vec);
template <class T, size_t size>
inline void scan(std::array<T, size> &vec);
template <class T, class L>
inline void scan(std::pair<T, L> &p);
template <class T, size_t size>
inline void scan(T (&vec)[size]);
template <class T>
inline void scan(std::vector<T> &vec) {
for (auto &i : vec) scan(i);
}
template <class T>
inline void scan(std::deque<T> &vec) {
for (auto &i : vec) scan(i);
}
template <class T, size_t size>
inline void scan(std::array<T, size> &vec) {
for (auto &i : vec) scan(i);
}
template <class T, class L>
inline void scan(std::pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size>
inline void scan(T (&vec)[size]) {
for (auto &i : vec) scan(i);
}
template <class T>
inline void scan(T &a) {
std::cin >> a;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { std::cout << ' '; }
inline void print(const bool &a) { std::cout << a; }
inline void print(const int32_t &a) { std::cout << a; }
inline void print(const uint32_t &a) { std::cout << a; }
inline void print(const int64_t &a) { std::cout << a; }
inline void print(const uint64_t &a) { std::cout << a; }
inline void print(const char &a) { std::cout << a; }
inline void print(const char a[]) { std::cout << a; }
inline void print(const float &a) { std::cout << a; }
inline void print(const double &a) { std::cout << a; }
inline void print(const long double &a) { std::cout << a; }
inline void print(const std::string &a) {
for (auto &&i : a) print(i);
}
template <class T>
inline void print(const std::vector<T> &vec);
template <class T, size_t size>
inline void print(const std::array<T, size> &vec);
template <class T, class L>
inline void print(const std::pair<T, L> &p);
template <class T, size_t size>
inline void print(const T (&vec)[size]);
template <class T>
inline void print(const std::vector<T> &vec) {
if (vec.empty()) return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T>
inline void print(const std::deque<T> &vec) {
if (vec.empty()) return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T, size_t size>
inline void print(const std::array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T, class L>
inline void print(const std::pair<T, L> &p) {
print(p.first);
std::cout << ' ';
print(p.second);
}
template <class T, size_t size>
inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
std::cout << ' ';
print(*i);
}
}
template <class T>
inline void print(const T &a) {
std::cout << a;
}
inline void out() { std::cout << '\n'; }
template <class T>
inline void out(const T &t) {
print(t);
std::cout << '\n';
}
template <class Head, class... Tail>
inline void out(const Head &head, const Tail &...tail) {
print(head);
std::cout << ' ';
out(tail...);
}
inline void Yes(bool i = true) { out(i ? "Yes" : "No"); }
inline void No(bool i = true) { out(i ? "No" : "Yes"); }
inline void Takahashi(bool i = true) { out(i ? "Takahashi" : "Aoki"); }
inline void Aoki(bool i = true) { out(i ? "Aoki" : "Takahashi"); }
inline void Alice(bool i = true) { out(i ? "Alice" : "Bob"); }
inline void Bob(bool i = true) { out(i ? "Bob" : "Alice"); }
inline void First(bool i = true) { out(i ? "First" : "Second"); }
inline void Second(bool i = true) { out(i ? "Second" : "First"); }
inline void Possible(bool i = true) { out(i ? "Possible" : "Impossible"); }
inline void Impossible(bool i = true) { out(i ? "Impossible" : "Possible"); }
inline void fls() { std::flush(std::cout); }
struct IOsetup {
IOsetup() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(16);
}
} iosetup;
#line 9 "Template/Util.hpp"
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
using uint = uint32_t;
using pll = std::pair<ll, ll>;
using pii = std::pair<int32_t, int32_t>;
using vl = std::vector<ll>;
using vvl = std::vector<std::vector<ll>>;
using pdd = std::pair<ld, ld>;
using tuplis = std::array<ll, 3>;
template <class T>
using pq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
constexpr ll LINF = (1LL << 62) - (1LL << 31);
constexpr int32_t INF = INT_MAX >> 1;
constexpr ll MINF = 1LL << 40;
constexpr ld DINF = std::numeric_limits<ld>::infinity();
constexpr int32_t MODD = 1000000007;
constexpr int32_t MOD = 998244353;
constexpr ld EPS = 1e-9;
constexpr ld PI = 3.1415926535897932;
const ll four[] = {0, 1, 0, -1, 0};
const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T>
ll sum(const T &a) {
return accumulate(std::begin(a), std::end(a), 0LL);
}
template <class T>
ld dsum(const T &a) {
return accumulate(std::begin(a), std::end(a), 0.0L);
}
template <class T>
auto min(const T &a) {
return *min_element(std::begin(a), std::end(a));
}
template <class T>
auto max(const T &a) {
return *max_element(std::begin(a), std::end(a));
}
#line 1 "Template/Macro.hpp"
#define _overload3(_1, _2, _3, name, ...) name
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _rep1(i, n) for (int64_t i = 0; i < (n); i++)
#define _rep2(i, a, b) for (int64_t i = (a); i < (b); i++)
#define _rep3(i, a, b, c) for (int64_t i = (a); i < (b); i += (c))
#define rep(...) _overload4(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(i, n) for (int64_t i = (n) - 1; i >= 0; i--)
#define _rrep2(i, a, b) for (int64_t i = (b) - 1; i >= (a); i--)
#define rrep(...) _overload3(__VA_ARGS__, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, ...) for (auto&& i : __VA_ARGS__)
#define all(i) std::begin(i), std::end(i)
#define rall(i) std::rbegin(i), std::rend(i)
#define len(x) ((int64_t)(x).size())
#define fi first
#define se second
#define uniq(x) x.erase(unique(all(x)), std::end(x))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__);
#define vv(type, name, h, ...) std::vector<std::vector<type>> name(h, std::vector<type>(__VA_ARGS__));
#define INT(...) int32_t __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) int64_t __VA_ARGS__; in(__VA_ARGS__)
#define ULL(...) uint64_t __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) std::string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) long double __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) std::vector<type> name(size); in(name)
#define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); in(name)
#line 4 "Verify/verify-yosupo-datastructure/predecessor_problem-segment_tree.test.cpp"
struct raq {
using T = ll;
static T op(T x, T y) { return x + y; }
static inline T e = 0;
};
void solve() {
LL(N, Q);
STR(T);
vec(ll, t, N, 0);
rep(i, N) {
if (T[i] == '1') t[i] = 1;
}
SegmentTree<raq> seg(t);
rep(i, Q) {
LL(c, k);
if (c == 0) {
if (!seg.get(k)) {
seg.set(k, 1);
}
}
if (c == 1) {
if (seg.get(k)) {
seg.set(k, 0);
}
}
if (c == 2) {
out(seg.get(k));
}
if (c == 3) {
ll ans = seg.max_right(k, [](ll x) { return x == 0; });
if (ans < N) {
out(ans);
} else {
out(-1);
}
}
if (c == 4) {
ll ans = seg.min_left(k + 1, [](ll x) { return x == 0; });
out(ans - 1);
}
}
}
int main() { solve(); }