제출 #334902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334902		amunduzbaev	Segments (IZhO18_segments)	C++14	0 / 100	4675 ms	2684 KiB

segments

#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;
			 //cout<<lastans<<"\n";
			 l = (t ? (lastans ^ l) : 0);
			 r = (t ? (lastans ^ r) : 0);
			 vec.pb({l, r});
		 }else if(type == 2){
			 int ind;
			 cin>>ind;
			 auto it = vec.begin();
			 --ind, it += ind;
			 vec.erase(it);
		 }else{
			 int l, r, mn;
			 cin>>l>>r>>mn;
			 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;
		 }
		// 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
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25