oj.uz

Submission #334909

# Submission time Handle Problem Language Result Execution time Memory
334909 2020-12-10T08:31:36 Z amunduzbaev Segments (IZhO18_segments) C++14
0 / 100
 5000 ms 1260 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 2000;

int n, t;
vector<pii>vec;
void solve(){
	
	cin>>n>>t;
	int lastans = 0;
	for(int i=0;i<n;i++){
		 int type;
		 cin>>type;
		 if(type == 1){
			 int l, r;
			 cin>>l>>r;
			 l = ((t * lastans) ^ l);
			 r = ((t * lastans) ^ r);
		//	 cout<<l<<" "<<r<<" "<<lastans<<"\n";
			 vec.pb({l, r});
		 }else if(type == 2){
			 int ind;
			 cin>>ind;
			 auto it = vec.begin();
			 it += (ind-1);
			 vec.erase(it);
		 }else{
			 int l, r, mn;
			 cin>>l>>r>>mn;
			 l = (l ^ (t * lastans));
			 r = (r ^ (t * lastans));
			 int ans = 0;
			 for(auto x:vec){
				 int lx = x.ff, rx = x.ss;
				 if(lx > r && rx < l) continue;
				 if(min(r, rx) - max(l, lx)+1 >= mn) ans++;
			 }
			 cout<<ans<<"\n";
			 lastans = ans;
		}
		//cout<<"el__\n";
		//for(auto x:vec) cout<<x.ff<<" "<<x.ss<<"\n";
		//cout<<"\n";
	}
	
	return;
}

int main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5053 ms 1260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -