#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
using namespace std;
const long long oo = 1000000000000000000;
long long int sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
freopen ( "sum.in", "r", stdin )
*/
set <pair<int, pair<int, int> > > st;
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m, t, l, r, x, ll, rr;
cin >> n >> m;
ans = 0;
while ( n -- ) {
cin >> t >> l;
if ( t == 1 ) {
cin >> r;
l = ( l ^ ( m * ans ) );
r = ( r ^ ( m * ans ) );
if ( l > r )
swap( l, r );
num ++;
st.insert( { num, make_pair( l, r ) } );
}
else if ( t == 2 ) {
st.erase( st.lower_bound( { l, make_pair( 0, 0 ) } ) );
}
else {
cin >> r >> x;
l = ( l ^ ( m * ans ) );
r = ( r ^ ( m * ans ) );
if ( l > r )
swap( l, r );
ans = 0;
for ( auto i : st ) {
if ( i.second.second >= l && i.second.first <= r ) {
ll = max( i.second.first, l );
rr = min( i.second.second, r );
if ( rr - ll + 1 >= x )
ans ++;
}
}
cout << ans << "\n";
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
44 ms |
460 KB |
Output is correct |
6 |
Correct |
54 ms |
548 KB |
Output is correct |
7 |
Correct |
17 ms |
356 KB |
Output is correct |
8 |
Correct |
36 ms |
484 KB |
Output is correct |
9 |
Correct |
28 ms |
468 KB |
Output is correct |
10 |
Correct |
14 ms |
588 KB |
Output is correct |
11 |
Correct |
98 ms |
460 KB |
Output is correct |
12 |
Correct |
74 ms |
460 KB |
Output is correct |
13 |
Correct |
13 ms |
584 KB |
Output is correct |
14 |
Correct |
31 ms |
460 KB |
Output is correct |
15 |
Correct |
3 ms |
204 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
25 ms |
376 KB |
Output is correct |
18 |
Correct |
21 ms |
556 KB |
Output is correct |
19 |
Correct |
25 ms |
400 KB |
Output is correct |
20 |
Correct |
27 ms |
412 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
5096 ms |
3428 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
75 ms |
524 KB |
Output is correct |
2 |
Correct |
43 ms |
332 KB |
Output is correct |
3 |
Correct |
171 ms |
544 KB |
Output is correct |
4 |
Correct |
52 ms |
376 KB |
Output is correct |
5 |
Execution timed out |
5098 ms |
4796 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
47 ms |
332 KB |
Output is correct |
2 |
Correct |
65 ms |
340 KB |
Output is correct |
3 |
Correct |
58 ms |
344 KB |
Output is correct |
4 |
Correct |
81 ms |
468 KB |
Output is correct |
5 |
Execution timed out |
5071 ms |
5136 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
44 ms |
460 KB |
Output is correct |
6 |
Correct |
54 ms |
548 KB |
Output is correct |
7 |
Correct |
17 ms |
356 KB |
Output is correct |
8 |
Correct |
36 ms |
484 KB |
Output is correct |
9 |
Correct |
28 ms |
468 KB |
Output is correct |
10 |
Correct |
14 ms |
588 KB |
Output is correct |
11 |
Correct |
98 ms |
460 KB |
Output is correct |
12 |
Correct |
74 ms |
460 KB |
Output is correct |
13 |
Correct |
13 ms |
584 KB |
Output is correct |
14 |
Correct |
31 ms |
460 KB |
Output is correct |
15 |
Correct |
3 ms |
204 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
25 ms |
376 KB |
Output is correct |
18 |
Correct |
21 ms |
556 KB |
Output is correct |
19 |
Correct |
25 ms |
400 KB |
Output is correct |
20 |
Correct |
27 ms |
412 KB |
Output is correct |
21 |
Execution timed out |
5096 ms |
3428 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
44 ms |
460 KB |
Output is correct |
6 |
Correct |
54 ms |
548 KB |
Output is correct |
7 |
Correct |
17 ms |
356 KB |
Output is correct |
8 |
Correct |
36 ms |
484 KB |
Output is correct |
9 |
Correct |
28 ms |
468 KB |
Output is correct |
10 |
Correct |
14 ms |
588 KB |
Output is correct |
11 |
Correct |
98 ms |
460 KB |
Output is correct |
12 |
Correct |
74 ms |
460 KB |
Output is correct |
13 |
Correct |
13 ms |
584 KB |
Output is correct |
14 |
Correct |
31 ms |
460 KB |
Output is correct |
15 |
Correct |
3 ms |
204 KB |
Output is correct |
16 |
Correct |
3 ms |
332 KB |
Output is correct |
17 |
Correct |
25 ms |
376 KB |
Output is correct |
18 |
Correct |
21 ms |
556 KB |
Output is correct |
19 |
Correct |
25 ms |
400 KB |
Output is correct |
20 |
Correct |
27 ms |
412 KB |
Output is correct |
21 |
Execution timed out |
5096 ms |
3428 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |