POJ2528 线段树离散化** + 染色

最新推荐文章于 2024-10-09 22:28:58 发布

Strezia

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量86

点赞数

分类专栏：数据结构 kuangbin POJ 文章标签：算法

本文链接：https://blog.csdn.net/m0_59273843/article/details/120628675

版权

数据结构同时被 3 个专栏收录

43 篇文章 0 订阅

订阅专栏

POJ

14 篇文章 0 订阅

订阅专栏

kuangbin

12 篇文章 0 订阅

订阅专栏

POJ2528

参考题解

到底是怎么离散化的？

// Decline is inevitable,
// Romance will last forever.
//#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <vector>
using namespace std;
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
//#define int long long
const int maxn = 4e4 + 10;
const int P = 1e9 + 7;
int n, m;
int port[maxn], cnt;
int pl[maxn], pr[maxn];
int vis[maxn];
int ans;
struct segment_tree {
    int l, r;
    int sum, add;
    int color;
#define sum(x) tree[x].sum
#define add(x) tree[x].add
#define l(x) tree[x].l
#define r(x) tree[x].r
#define color(x) tree[x].color
}tree[maxn << 2];
void spread(int p) {
    if(color(p)) {
        color(p<<1) = color(p<<1|1) = color(p);
        color(p) = 0;
    }
}
void build(int p, int l, int r) {
    l(p) = l; r(p) = r;
    if(l == r)
        return;
    int mid = (l + r) >> 1;
    build(p<<1, l, mid);
    build(p<<1|1, mid + 1, r);
}
void r_change(int p, int l, int r, int d) {
    if(l <= l(p) && r >= r(p)) {
        color(p) = d;
        return;
    }
    spread(p);
    int mid = (l(p) + r(p)) >> 1;
    if(l <= mid) r_change(p<<1, l, r, d);
    if(r > mid) r_change(p<<1|1, l, r, d);

}
void query(int p, int l, int r) {
    if(color(p)) {
        if(!vis[color(p)]) {
            vis[color(p)]++;
            ans++;
        }
        return;
    }
    if(l == r) return;
    int mid = (l + r) >> 1;
    query(p<<1, l, mid);
    query(p<<1|1, mid + 1, r);
}
void solve() {
    cin >> n;
    mst(vis, 0);
    mst(tree, 0);
    mst(port, 0);
    cnt = 0;
    for(int i = 1; i <= n; i++) {
        cin >> pl[i] >> pr[i];
        port[++cnt] = pl[i];
        port[++cnt] = pr[i];
    }
    sort(port + 1, port + 1 + cnt);
    int tmp = cnt;
    cnt = 1;
//    cnt = unique(port, port + cnt) - port;
    for(int i = 2; i <= tmp; i++) {
        if(port[i-1] != port[i])
            port[++cnt] = port[i];
    }
    int tmp2 = cnt;
    for(int i = tmp2; i > 1; i--) {
        if(port[i] - port[i-1] > 1)
            port[++cnt] = port[i-1] + 1;
    }
    sort(port + 1, port + 1 + cnt);
    build(1, 1, cnt);
    for(int i = 1; i <= n; i++) {
        int l = lower_bound(port+1, port+cnt+1, pl[i]) -port;
        int r = lower_bound(port+1, port+cnt+1, pr[i]) -port;
        r_change(1, l, r, i);
    }
    ans = 0;
    query(1, 1, cnt);
    cout << ans << endl;
}
signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int T;
    cin >> T;
    while(T--)
        solve();
    return 0;
}