#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e3;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
int n, t, last, cur;
multiset<pair<int,pair<int, int>>> st;
pair<int,int> seg[N];
const void solve(/*Armashka*/) {
cin >> n >> t;
while (n --) {
int type; cin >> type;
if (type == 1) {
int a, b;
cin >> a >> b;
int l = a ^ (t * last), r = b ^ (t * last);
if (l > r) swap(l, r);
st.insert({cur + 1, {l, r}});
seg[++ cur] = {l, r};
} else if (type == 2) {
int id; cin >> id;
st.erase({id, seg[id]});
seg[id] = {0, 0};
} else {
int a, b, k, ans = 0;
cin >> a >> b >> k;
int l = a ^ (t * last), r = b ^ (t * last);
if (l > r) swap(l, r);
for (auto cur : st) {
int x = cur.sd.ft, y = cur.sd.sd;
if (max(x, l) <= min(y, r)) {
int cnt = min(y, r) - max(x, l) + 1;
if (cnt >= k) ++ ans;
}
}
cout << ans << "\n";
last = ans;
}
}
}
signed main() {
fast;
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
int tt = 1;
// cin >> tt;
while (tt --) {
solve();
}
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
40 ms |
616 KB |
Output is correct |
6 |
Correct |
45 ms |
560 KB |
Output is correct |
7 |
Correct |
13 ms |
364 KB |
Output is correct |
8 |
Correct |
26 ms |
512 KB |
Output is correct |
9 |
Correct |
23 ms |
460 KB |
Output is correct |
10 |
Correct |
10 ms |
588 KB |
Output is correct |
11 |
Correct |
58 ms |
500 KB |
Output is correct |
12 |
Correct |
65 ms |
472 KB |
Output is correct |
13 |
Correct |
14 ms |
588 KB |
Output is correct |
14 |
Correct |
27 ms |
500 KB |
Output is correct |
15 |
Correct |
2 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
22 ms |
412 KB |
Output is correct |
18 |
Correct |
16 ms |
600 KB |
Output is correct |
19 |
Correct |
21 ms |
432 KB |
Output is correct |
20 |
Correct |
22 ms |
432 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
5034 ms |
3948 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
87 ms |
640 KB |
Output is correct |
2 |
Correct |
49 ms |
556 KB |
Output is correct |
3 |
Correct |
191 ms |
680 KB |
Output is correct |
4 |
Correct |
56 ms |
580 KB |
Output is correct |
5 |
Execution timed out |
5030 ms |
5376 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
54 ms |
580 KB |
Output is correct |
2 |
Correct |
63 ms |
624 KB |
Output is correct |
3 |
Correct |
61 ms |
660 KB |
Output is correct |
4 |
Correct |
70 ms |
604 KB |
Output is correct |
5 |
Execution timed out |
5040 ms |
5748 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
40 ms |
616 KB |
Output is correct |
6 |
Correct |
45 ms |
560 KB |
Output is correct |
7 |
Correct |
13 ms |
364 KB |
Output is correct |
8 |
Correct |
26 ms |
512 KB |
Output is correct |
9 |
Correct |
23 ms |
460 KB |
Output is correct |
10 |
Correct |
10 ms |
588 KB |
Output is correct |
11 |
Correct |
58 ms |
500 KB |
Output is correct |
12 |
Correct |
65 ms |
472 KB |
Output is correct |
13 |
Correct |
14 ms |
588 KB |
Output is correct |
14 |
Correct |
27 ms |
500 KB |
Output is correct |
15 |
Correct |
2 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
22 ms |
412 KB |
Output is correct |
18 |
Correct |
16 ms |
600 KB |
Output is correct |
19 |
Correct |
21 ms |
432 KB |
Output is correct |
20 |
Correct |
22 ms |
432 KB |
Output is correct |
21 |
Execution timed out |
5034 ms |
3948 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
40 ms |
616 KB |
Output is correct |
6 |
Correct |
45 ms |
560 KB |
Output is correct |
7 |
Correct |
13 ms |
364 KB |
Output is correct |
8 |
Correct |
26 ms |
512 KB |
Output is correct |
9 |
Correct |
23 ms |
460 KB |
Output is correct |
10 |
Correct |
10 ms |
588 KB |
Output is correct |
11 |
Correct |
58 ms |
500 KB |
Output is correct |
12 |
Correct |
65 ms |
472 KB |
Output is correct |
13 |
Correct |
14 ms |
588 KB |
Output is correct |
14 |
Correct |
27 ms |
500 KB |
Output is correct |
15 |
Correct |
2 ms |
332 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
22 ms |
412 KB |
Output is correct |
18 |
Correct |
16 ms |
600 KB |
Output is correct |
19 |
Correct |
21 ms |
432 KB |
Output is correct |
20 |
Correct |
22 ms |
432 KB |
Output is correct |
21 |
Execution timed out |
5034 ms |
3948 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |