#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+7;
int n, t;
pair<int, int> a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> t;
int ans = 0, timer = 0;
multiset<pair<int, int> > s;
for(int i = 1; i <= n; ++i) {
char tp;
cin >> tp;
if(tp == '1') {
int l, r;
cin >> l >> r;
l = (l^(t*ans));
r = (r^(t*ans));
if(l>r) {
swap(l, r);
}
a[++timer] = {l, r};
s.insert({l, r});
} else if(tp == '2') {
int id;
cin >> id;
auto it = s.find(a[id]);
s.erase(it);
} else {
int l, r, k;
cin >> l >> r >> k;
l = (l^(t*ans));
r = (r^(t*ans));
if(l>r) {
swap(l, r);
}
int res = 0;
for(auto [x, y] : s) {
if(y<l) {
continue;
}
if(x>r) {
continue;
}
if(x<=l) {
res += (y>=l+k-1);
continue;
}
if(y>=r) {
res += (x<=r-k+1);
continue;
}
ans += (y-x+1>=k);
}
cout << res << "\n";
ans = res;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Incorrect |
2 ms |
484 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5055 ms |
3180 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
62 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
37 ms |
808 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Incorrect |
2 ms |
484 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Incorrect |
2 ms |
484 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |