#pragma GCC optimize("unroll-loops,O3")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx,popcnt")
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using ld = long double;
//#define int ll
#define sz(x) ((int)(x).size())
using pii = pair<int,int>;
using tii = tuple<int,int,int>;
const int nmax = 2e5 + 5;
pii segments[nmax];
struct Oper {
char type;
int a, b;
int k;
};
namespace Precalc {
multiset<pii> actives_sortfwr;
auto cmp = [](const pii& a, const pii& b) -> bool { return a.second < b.second || (a.second == b.second && a.first < b.first); };
multiset<pii, decltype(cmp)> actives_sortbckw(cmp);
void rebatch(vector<Oper> opqueue) {
for(auto [t, a, b, k] : opqueue) {
if(t == 1)
actives_sortfwr.insert(pii{a, b}),
actives_sortbckw.insert(pii{a, b});
else if(t == 2)
actives_sortfwr.erase(actives_sortfwr.find(segments[a])),
actives_sortbckw.erase(actives_sortbckw.find(segments[a]));
}
return;
}
struct Item {
int link;
int sum, own;
};
#warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia
#warning poate e doar Bmax sau ceva (700) (pt MLE sau cv)
set<pii> fwrpoz;
set<pii> bckwpoz;
int freq[nmax];
Item fwr[nmax], bckw[nmax];
pii atrf[nmax], atrb[nmax];
map<int, int> norm_Ks;
vector<int> currKs;
int n;
void contextualize(vector<int> Ks) {
norm_Ks.clear();
for(auto x : Ks) norm_Ks[x];
int ptrnrm = 0;
for(auto &[a, b] : norm_Ks) freq[ptrnrm] = 0, b = ptrnrm++;
fwrpoz.clear(), bckwpoz.clear();
{ // forward links
pii lst = {-1, -1};
n = 0;
for(auto [a, b] : actives_sortfwr) {
int k = b - a + 1;
if(k < Ks[0]) continue;
if(pii{a, b} != lst) { n++; fwr[n].sum = fwr[n].own = 0; }
atrf[n] = lst = pii{a, b};
fwr[n].own++;
}
vector<int> counter_app(sz(Ks));
for(int i = n, atrcoef = sz(Ks) - 1; i > 0; atrcoef = (atrcoef == 0? sz(Ks) - 1 : atrcoef - 1), i--) {
auto [a, b] = atrf[i];
int poz = distance(begin(Ks), prev(upper_bound(all(Ks), b - a + 1)));
counter_app[poz] += fwr[i].own;
fwr[i].link = atrcoef;
fwr[i].sum = counter_app[atrcoef];
fwrpoz.emplace(pii{a, i});
}
}
// ----
{ // backward links
pii lst = {-1, -1};
n = 0;
for(auto [a, b] : actives_sortbckw) {
int k = b - a + 1;
if(k < Ks[0]) continue;
if(pii{a, b} != lst) { n++; bckw[n].sum = bckw[n].own = 0; }
atrb[n] = lst = pii{a, b};
bckw[n].own++;
}
vector<int> counter_app(sz(Ks));
for(int i = 1, atrcoef = sz(Ks) - 1; i <= n; atrcoef = (atrcoef == 0? sz(Ks) - 1 : atrcoef - 1), i++) {
auto [a, b] = atrb[i];
int poz = distance(begin(Ks), prev(upper_bound(all(Ks), b - a + 1)));
counter_app[poz] += bckw[i].own;
bckw[i].link = atrcoef;
bckw[i].sum = counter_app[atrcoef];
bckwpoz.emplace(pii{b, i});
}
}
for(auto [a, b] : actives_sortfwr) {
int k = b - a + 1;
if(k < Ks[0]) continue;
freq[distance(begin(Ks), prev(upper_bound(all(Ks), k)))]++;
}
for(int i = sz(Ks) - 2; i >= 0; i--)
freq[i] += freq[i + 1];
currKs = move(Ks);
}
int query_K(int k) {
return freq[norm_Ks[k]];
}
int query_L(int L, int k) {
k = norm_Ks[k];
auto it = bckwpoz.upper_bound(pii{L + 1, - 1});
if(it == bckwpoz.begin()) return 0;
int poz = prev(it) -> second, l = max(k, bckw[poz].link), r = l - 1;
bool initially = l == k;
int rez = 0;
auto breakcondition = [&]() -> bool {
if(initially) return r + 1 < sz(currKs);
return k < l;
};
auto belongcondition = [&](int len) -> bool {
return (currKs[k] <= len && len < currKs[l]) || (r + 1 < sz(currKs) && currKs[r + 1] <= len);
};
while(breakcondition() && poz > 0) {
if(bckw[poz].link == r + 1) { rez += bckw[poz].sum; r++; }
else if(bckw[poz].link == k) { rez += bckw[poz].sum; k++; }
if(breakcondition() && belongcondition(atrb[poz].second - atrb[poz].first + 1)) rez += bckw[poz].own;
poz--;
}
return rez;
}
int query_R(int R, int k) {
k = norm_Ks[k];
auto it = fwrpoz.upper_bound(pii{R, - 1});
if(it == fwrpoz.end()) return 0;
int poz = it -> second, l = max(k, fwr[poz].link), r = l - 1;
bool initially = l == k;
int rez = 0;
auto breakcondition = [&]() -> bool {
if(initially) return r + 1 < sz(currKs);
return k < l;
};
auto belongcondition = [&](int len) -> bool {
return (currKs[k] <= len && len < currKs[l]) || (r + 1 < sz(currKs) && currKs[r + 1] <= len);
};
while(breakcondition() && poz <= n) {
if(fwr[poz].link == r + 1) { rez += fwr[poz].sum; r++; }
else if(fwr[poz].link == k) { rez += fwr[poz].sum; k++; }
if(breakcondition() && belongcondition(atrf[poz].second - atrf[poz].first + 1)) rez += fwr[poz].own;
poz++;
}
return rez;
}
}
//#error in loc sa ai pozitii care corespund unor segmente bune, doar pune suma partiala a alora congruenti cu (-pozitia) mod sz(Ks)
int segmpoz = 1;
int unitValue(int l, int r, int a, int b, int k) {
return min(r, b) - max(l, a) + 1 >= k;
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int n, t_offline;
cin >> n >> t_offline;
const int idealBuck = 4000;
const ll worstInner = (ll)idealBuck * n + 5;
vector<Oper> operation_queue;
operation_queue.reserve(n);
vector<int> results;
results.reserve(n);
int lastans = 0;
auto flush_queue = [&]() {
vector<int> Ks;
Ks.reserve(sz(operation_queue));
for(auto [t, a, b, k] : operation_queue)
if(t == 3) Ks.emplace_back(k);
if(sz(Ks) == 0) return;
sort(all(Ks));
Ks.erase(unique(all(Ks)), Ks.end());
Precalc::contextualize(Ks);
vector<Oper> pule;
pule.reserve(sz(operation_queue));
for(int i = 0; i < sz(operation_queue); i++) {
auto &[ti, ai, bi, ki] = operation_queue[i];
if(ti == 1 || ti == 3) {
ai = ai ^ (lastans);
bi = bi ^ (lastans);
if(ai > bi) swap(ai, bi);
}
if(ti == 1)
segments[segmpoz++] = pii{ai, bi};
if(ti == 3) {
if(bi - ai + 1 < ki) {
lastans = 0;
}
else {
int rez = Precalc::query_K(ki) - Precalc::query_R(bi - ki + 1 + 1, ki) - Precalc::query_L(ai + ki - 1 - 1, ki);
for(auto [tj, aj, bj, kj] : pule) {
if(tj == 2)
rez -= unitValue(ai, bi, segments[aj].first, segments[aj].second, ki);
else
rez += unitValue(ai, bi, aj, bj, ki);
}
lastans = rez;
}
results.emplace_back(lastans);
}
else
pule.emplace_back(Oper{ti, ai, bi, ki});
}
Precalc::rebatch(operation_queue);
operation_queue.clear();
};
int cnt[2] = {1, 0};
for(int t, a, b, k, tc = 0; tc < n; tc++) {
cin >> t;
if(t == 1) {
cin >> a >> b;
operation_queue.emplace_back(Oper{t, a, b, -1});
cnt[0]++;
}
if(t == 2) {
cin >> a;
operation_queue.emplace_back(Oper{t, a, -1, -1});
cnt[0]++;
}
if(t == 3) {
cin >> a >> b >> k;
operation_queue.emplace_back(Oper{t, a, b, k});
cnt[1]++;
}
if(tc == n - 1 || sz(operation_queue) >= idealBuck) {
flush_queue();
cnt[1] = 0;
cnt[0] = sz(Precalc::actives_sortbckw);
}
}
for(auto x : results) cout << x << '\n';
return 0;
}
/**
Anul asta nu se da centroid
-- Rugaciunile mele
*/
Compilation message
segments.cpp:49:4: warning: #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia [-Wcpp]
49 | #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia
| ^~~~~~~
segments.cpp:50:4: warning: #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv) [-Wcpp]
50 | #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv)
| ^~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:275:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
275 | operation_queue.emplace_back(Oper{t, a, b, -1});
| ^
segments.cpp:280:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
280 | operation_queue.emplace_back(Oper{t, a, -1, -1});
| ^
segments.cpp:285:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
285 | operation_queue.emplace_back(Oper{t, a, b, k});
| ^
segments.cpp:209:12: warning: unused variable 'worstInner' [-Wunused-variable]
209 | const ll worstInner = (ll)idealBuck * n + 5;
| ^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 5 |
Incorrect |
16 ms |
9564 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2989 ms |
22824 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
104 ms |
11124 KB |
Output is correct |
| 2 |
Correct |
96 ms |
11036 KB |
Output is correct |
| 3 |
Incorrect |
101 ms |
11152 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
113 ms |
11472 KB |
Output is correct |
| 2 |
Correct |
112 ms |
11432 KB |
Output is correct |
| 3 |
Correct |
114 ms |
11352 KB |
Output is correct |
| 4 |
Correct |
120 ms |
11536 KB |
Output is correct |
| 5 |
Incorrect |
3122 ms |
27856 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 5 |
Incorrect |
16 ms |
9564 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9052 KB |
Output is correct |
| 5 |
Incorrect |
16 ms |
9564 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
