#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
const int N=505;
int v[N][N]{};
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,t;cin>>n>>t;
int ans=0;
vector<int> a,b,h;
for(int i=0;i<n;i++){
int id;cin>>id;
if(id==1){
int c,d;cin>>c>>d;
c^=(t*ans);
d^=(t*ans);
a.push_back(c);
b.push_back(d);
h.push_back(1);
}
if(id==2){
int p;cin>>p;
h[p-1]=0;
}
if(id==3){
int c,d,k;cin>>c>>d>>k;
c^=(t*ans);
d^=(t*ans);
ans=0;
int sz=a.size();
for(int j=0;j<sz;j++){
if(min(b[j],d)-max(a[j],c)>=k&&h[j]==1){
ans++;
}
}
cout<<ans<<endl;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5047 ms |
2080 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2481 ms |
2056 KB |
Output is correct |
2 |
Correct |
2440 ms |
1748 KB |
Output is correct |
3 |
Correct |
2486 ms |
2016 KB |
Output is correct |
4 |
Correct |
2438 ms |
1988 KB |
Output is correct |
5 |
Execution timed out |
5027 ms |
2868 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2056 ms |
1488 KB |
Output is correct |
2 |
Correct |
2041 ms |
1708 KB |
Output is correct |
3 |
Correct |
2083 ms |
1568 KB |
Output is correct |
4 |
Correct |
2068 ms |
1480 KB |
Output is correct |
5 |
Execution timed out |
5006 ms |
2740 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |