제출 #335284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335284		limabeans	Segments (IZhO18_segments)	C++17	0 / 100	5092 ms	6796 KiB

segments

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;

int n,t;
multiset<pair<int,int>> ms;
int id;

pair<int,int> a[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n>>t;

    int lastans=0;

    while (n--) {
	int op;
	cin>>op;
	if (op==1) {
	    ++id;
	    cin>>a[id].first>>a[id].second;
	    ms.insert({a[id].first,a[id].second});
	} else if (op==2) {
	    int i;
	    cin>>i;
	    ms.erase(ms.find({a[i].first,a[i].second}));
	} else if (op==3) {
	    int l,r,k;
	    cin>>l>>r>>k;
	    l=l^(t*lastans);
	    r=r^(t*lastans);
	    int res=0;
	    for (auto p: ms) {
		int x=max(l,p.first);
		int y=min(r,p.second);
		if (y-x+1>=k) res++;
	    }
	    cout<<res<<"\n";
	    lastans=res;
	} else assert(false);
    }
    
    
    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