제출 #682540

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
682540		phoenix	Segments (IZhO18_segments)	C++17	23 / 100	5092 ms	1780 KiB

segments

#include<bits/stdc++.h>

using namespace std;
vector<bool> us;
vector<pair<int, int>> v;
int lastans;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	us.push_back(0);
	v.push_back({0, 0});
	
	int n, t;
	cin >> n >> t;
	for(int i = 1; i <= n; i++) {
		int type;
		cin >> type;
		if(type == 1) {
			int l, r;
			cin >> l >> r;
			l = (l ^ (t * lastans));
			r = (r ^ (t * lastans));
			if(l > r) swap(l, r);

			v.push_back({l, r});
			us.push_back(1);
		}
		if(type == 2) {
			int id;
			cin >> id;
			us[id] = 0; 
		}
		if(type == 3) {
			int l, r, k;
			cin >> l >> r >> k;
			l = (l ^ (t * lastans));
			r = (r ^ (t * lastans));
			if(l > r) swap(l, r);
			if(r - l + 1 < k) {
				cout << 0 << '\n';
				continue;
			}
			lastans = 0;
			int c1 = 0, c2 = 0, c = 0;
			for(int i = 0; i < (int)v.size(); i++) {
				if(!us[i] || v[i].second - v[i].first + 1 < k) continue; 
				lastans++;
				c++;
				if(v[i].second < l + k - 1) c1++;
				if(v[i].first < r - k + 2) c2++;
			}
			lastans -= c1;
			lastans -= c - c2;
			cout << lastans << '\n';
		}
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 15
• Subtask 3: 16 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25