barrett/cp
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

895

Browse source
This commit is contained in:
Barrett Ruth 2025-04-06 11:27:25 -04:00
parent 94383fbaf7
commit 26f66e43d8
97 changed files with 5337 additions and 42 deletions
Download patch file Download diff file Expand all files Collapse all files

56
codeforces/895/a.cc
View file

@ -1,4 +1,4 @@
#include <bits/stdc++.h> // {{{
#include <bits/stdc++.h> // {{{
// https://codeforces.com/blog/entry/96344
@ -7,19 +7,23 @@
using namespace std;
template <typename T> [[nodiscard]] static T MIN() {
template <typename T>
[[nodiscard]] static T MIN() {
return std::numeric_limits<T>::min();
}
template <typename T> [[nodiscard]] static T MAX() {
template <typename T>
[[nodiscard]] static T MAX() {
return std::numeric_limits<T>::max();
}
template <typename T> [[nodiscard]] static T sc(auto &&x) {
template <typename T>
[[nodiscard]] static T sc(auto &&x) {
return static_cast<T>(x);
}
template <typename T> [[nodiscard]] static T sz(auto &&x) {
template <typename T>
[[nodiscard]] static T sz(auto &&x) {
return static_cast<T>(x.size());
}
@ -31,22 +35,38 @@ template <typename T> [[nodiscard]] static T sz(auto &&x) {
#define dbg(...) std::print(__VA_ARGS__)
#endif
inline static void NO() { prln("NO"); }
inline static void NO() {
prln("NO");
}
inline static void YES() { prln("YES"); }
inline static void YES() {
prln("YES");
}
using ll = long long;
using ld = long double;
template <typename T> using ve = std::vector<T>;
template <typename T, size_t N> using ar = std::array<T, N>;
template <typename T1, typename T2> using pa = std::pair<T1, T2>;
template <typename... Ts> using tu = std::tuple<Ts...>;
template <typename... Ts> using dq = std::deque<Ts...>;
template <typename... Ts> using qu = std::queue<Ts...>;
template <typename... Ts> using pq = std::priority_queue<Ts...>;
template <typename... Ts> using st = std::stack<Ts...>;
auto lb = [](auto... args) { return std::lower_bound(args...); };
auto ub = [](auto... args) { return std::upper_bound(args...); };
template <typename T>
using ve = std::vector<T>;
template <typename T, size_t N>
using ar = std::array<T, N>;
template <typename T1, typename T2>
using pa = std::pair<T1, T2>;
template <typename... Ts>
using tu = std::tuple<Ts...>;
template <typename... Ts>
using dq = std::deque<Ts...>;
template <typename... Ts>
using qu = std::queue<Ts...>;
template <typename... Ts>
using pq = std::priority_queue<Ts...>;
template <typename... Ts>
using st = std::stack<Ts...>;
auto lb = [](auto... args) {
return std::lower_bound(args...);
};
auto ub = [](auto... args) {
return std::upper_bound(args...);
};
#define ff first
#define ss second
@ -63,7 +83,7 @@ void solve() {
prln("{}", ceill(abs((b - a) / 2) / c));
}
int main() { // {{{
int main() { // {{{
cin.tie(nullptr)->sync_with_stdio(false);
cin.exceptions(cin.failbit);

14
codeforces/895/a.out
View file

@ -1,9 +1,9 @@
1
3
0
1
50
16
wit
wit
wit
wit
wit
wit
[code]: 0
[time]: 13.0444 ms
[time]: 13.4819 ms

2
codeforces/895/b.out
View file

@ -7,4 +7,4 @@
1
[code]: 0
[time]: 13.6361 ms
[time]: 12.7835 ms

2
codeforces/895/c.out
View file

@ -11,4 +11,4 @@
3137 9837632
[code]: 0
[time]: 13.5865 ms
[time]: 6.83761 ms

110
codeforces/895/e.cc
View file

@ -76,20 +76,106 @@ auto ub = [](auto... args) {
#define rall(x) (x).rbegin(), (x).rend()
// }}}
#include <stdexcept>
#include <vector>
template <typename T>
class segment_tree {
public:
explicit segment_tree(std::vector<T> const& data)
: n(data.size()), tree(2 * n, sentinel()), lazy(n, sentinel()) {
for (size_t i = 0; i < n; ++i)
tree[i + n] = data[i];
for (int i = n - 1; i > 0; --i)
tree[i] = merge(tree[i * 2], tree[i * 2 + 1]);
}
void update(int l, int r, T const& t) noexcept {
l += n, r += n + 1;
push(l);
push(r - 1);
for (int L = l, R = r; L < R; L /= 2, R /= 2) {
if (L & 1)
apply(L++, t);
if (R & 1)
apply(--R, t);
}
for (l /= 2; l; l /= 2)
tree[l] = merge(tree[l * 2], tree[l * 2 + 1]);
for (r = (r - 1) / 2; r; r /= 2)
tree[r] = merge(tree[r * 2], tree[r * 2 + 1]);
}
[[nodiscard]] T query(int l, int r) noexcept {
l += n, r += n + 1;
push(l);
push(r - 1);
T left = sentinel(), right = sentinel();
for (; l < r; l /= 2, r /= 2) {
if (l & 1)
left = merge(left, tree[l++]);
if (r & 1)
right = merge(tree[--r], right);
}
return merge(left, right);
}
private:
int n;
std::vector<T> tree, lazy;
[[nodiscard]] T merge(T const& a, T const& b) const {
return a ^ b;
}
[[nodiscard]] inline T do_apply(T const& a, T const& b) const {
return a & b;
}
[[nodiscard]] T sentinel() const {
return 0;
}
void push(int i) {
for (int h = __builtin_clz(n) - __builtin_clz(i); h > 0; --h) {
int p = i >> h;
if (lazy[p] != sentinel()) {
apply(p * 2, lazy[p]);
apply(p * 2 + 1, lazy[p]);
lazy[p] = sentinel();
}
}
}
void apply(int i, T const& t) {
tree[i] = do_apply(tree[i], t);
if (i < n)
lazy[i] = do_apply(lazy[i], t);
}
};
void solve() {
int n;
cin >> n;
ve<ll> a(n), prefix(n);
ve<ll> a(n); //, prefix(n);
for (auto& e : a)
cin >> e;
string s;
cin >> s;
int zeroes = 0;
// int zeroes = 0;
ve<ll> zero(n), one(n);
for (int i = 0; i < n; ++i) {
prefix[i] = a[i] ^ (i ? prefix[i - 1] : 0);
if (s[i] == '0')
zeroes ^= a[i];
// prefix[i] = a[i] ^ (i ? prefix[i - 1] : 0);
if (s[i] == '0') {
zero[i] = a[i];
one[i] = 0;
} else {
one[i] = a[i];
zero[i] = 0;
}
// zeroes ^= a[i];
}
segment_tree<ll> zeroes(zero), ones(one);
int q;
cin >> q;
int cmd, l, r, g;
@ -99,13 +185,17 @@ void solve() {
cin >> l >> r;
--l;
--r;
zeroes ^= prefix[r] ^ (l ? prefix[l - 1] : 0);
zeroes.update(l, r);
// zeroes ^= prefix[r] ^ (l ? prefix[l - 1] : 0);
} else {
cin >> g;
if (g == 0)
pr("{} ", zeroes);
else
pr("{} ", prefix.back() ^ zeroes);
if (g == 1) {
pr("{} ", (g == 1 ? ones : zeroes).query(0, n - 1));
}
// if (g == 0)
// pr("{} ", zeroes);
// else
// pr("{} ", prefix.back() ^ zeroes);
}
}
prln();

10
codeforces/895/e.out
View file

@ -1,8 +1,8 @@
3 2 6 7 7
11 7
0 0
2 2 2
11 11
16430827
47
[code]: 0
[time]: 13.0174 ms
[time]: 6.14762 ms