CCF-CSP202303D题星际网络II【100分】（结构清晰）

参考了
①CCF-CSP认证 202303 500分题解
但在离散化部分，就具体题目的情况采用了更简单的方式，直接字符串比较的方式来排序。
线段树部分就是较常见的区间覆盖，cnt记录区间内id非0的点的数量，mx记录区间内id非0的点的最大id，mn记录区间内id非0的点的最小id。具体判定的逻辑条件表示见代码或①
码风可能对初学者更好懂一些（yxc-like）

#include <bits/stdc++.h>

using namespace std;

const int M = 5e4 + 10;

int n, m;

int ops[M], ids[M];
string L[M], R[M], S[M];

vector<string> nums;
int INF;

struct NODE{
	int l, r;
	int mn, mx, cnt;
	int tag;
}tr[M << 4];

char hex_add_one(char x){
	if (x == '9') return 'a';
	else if (x == 'f') return '0';
	else return x + 1;
}

string add_one(string x){
	for (int i = x.size() - 1; i >= 0; i -- ){
		if (x[i] == ':') continue;
		x[i] = hex_add_one(x[i]);
		if (x[i] != '0') break;
	}
	return x;
}

int find(string x){
	return lower_bound(nums.begin(), nums.end(), x) - nums.begin() + 1;
}

void build(int u, int l, int r){
	if (l == r){
		tr[u] = {l, r, 1e9, -1e9, 0, 0};
		return;	
	}
	tr[u] = {l, r, 1e9, -1e9, 0, 0};
	int mid = tr[u].l + tr[u].r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}

void eval(int u, int id){
	tr[u].cnt = tr[u].r - tr[u].l + 1;
	tr[u].mx = tr[u].mn = id;
	tr[u].tag = id;
}

void push_down(int u){
	if (tr[u].tag == 0) return;
	eval(u << 1, tr[u].tag);
	eval(u << 1 | 1, tr[u].tag);
	tr[u].tag = 0;
}

void push_up(NODE &root, const NODE &left, const NODE &right){
	root.cnt = left.cnt + right.cnt;
	root.mx = max(left.mx, right.mx), root.mn = min(left.mn, right.mn);
}

NODE query(int u, int l, int r){
	if (l <= tr[u].l && tr[u].r <= r){
		return tr[u];	
	}
	
	push_down(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if (r <= mid){
		return query(u << 1, l, r);
	}
	else if (l > mid){
		return query(u << 1 | 1, l, r);
	}
	else{
		auto lt = query(u << 1, l, r), rt = query(u << 1 | 1, l, r);
		NODE res;
		push_up(res, lt, rt);
		return res;
	}
}

void modify(int u, int l, int r, int id){
	if (l <= tr[u].l && tr[u].r <= r){
		eval(u, id);
		return;
	}
	push_down(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if (l <= mid) modify(u << 1, l, r, id);
	if (r > mid) modify(u << 1 | 1, l, r, id);
	push_up(tr[u], tr[u << 1], tr[u << 1 | 1]);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> m;
	
	for (int i = 0; i < m; i ++ ){
		cin >> ops[i];
		int op = ops[i];
		if (op == 1){
			cin >> ids[i] >> L[i] >> R[i];
			nums.push_back(L[i]), nums.push_back(R[i]), nums.push_back(add_one(R[i]));
		}
		else if (op == 2){
			cin >> S[i];
			nums.push_back(S[i]), nums.push_back(add_one(S[i]));	
		}
		else{
			cin >> L[i] >> R[i];
			nums.push_back(L[i]), nums.push_back(R[i]), nums.push_back(add_one(R[i]));	
		}
	}
	sort(nums.begin(), nums.end());
	nums.erase(unique(nums.begin(), nums.end()), nums.end());
	INF = nums.size();
	
	//
	//for (auto t : nums) cout << t << endl;
	//
	
	build(1, 1, INF);
	
	for (int i = 0; i < m; i ++ ){
		int op = ops[i];
		if (op == 1){
			int id = ids[i], l = find(L[i]), r = find(R[i]);
			//cout << l << ' ' << r << endl;
			
			auto t = query(1, l, r);
			if (t.cnt == 0 || t.mx == t.mn && t.mn == id && t.cnt < r - l + 1){
				cout << "YES" << endl;
				modify(1, l, r, id);
			}
			else cout << "NO" << endl;
		}
		else if (op == 2){
			int s = find(S[i]);	
			auto t = query(1, s, s);
			if (t.cnt == 0) cout << 0 << endl;
			else cout << t.mn << endl;
		}
		else{
			int l = find(L[i]), r = find(R[i]);	
			auto t = query(1, l, r);
			if (t.cnt == r - l + 1 && t.mx == t.mn) cout << t.mn << endl;
			else cout << 0 << endl;
		}
	}
	
	
	return 0;
}

/*
32 2
1 1 0001:8000 0001:ffff
2 0001:a000

32 12
1 1 0001:8000 0001:ffff
2 0001:a000
3 0001:c000 0001:ffff
1 2 0000:0000 000f:ffff
2 0000:1000
1 1 0001:8000 0001:8fff
1 2 0000:0000 0000:ffff
2 0000:1000
1 1 0002:8000 0002:ffff
3 0001:8000 0002:ffff
1 1 0001:c000 0003:ffff
3 0001:8000 0002:ffff
*/

运行时间还行