2018 ccpc final

B. Balance of the Force

上来不难想到如何判impossible 以及划分成多个连通块

可跨连通块之间的选法如何选择呢 比赛的时候没想出来

其实是对于每个连通块来说 最大值进行排序 实时模拟最小值都有谁 如果符合题目中给出的连通块个数 那么更新答案即可

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

const int N = 200020, M = 2 * N;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1

int n, m;
int h[N], e[M], ne[M], idx;
int st[N], col[N], val[N][2];
int has_ans;
struct node{
    int maxl, minl;
    int id;
    bool operator < (const node &no) const{
        return maxl < no.maxl;
    }
};
vector <node> v;

void init() {
    idx = 0;
    has_ans = 1;
    for(int i = 1;i <= n;i ++) {
        st[i] = col[i] = 0;
        h[i] = -1;
    }
    v.clear();
}

void add(int u, int v) {
    e[idx] = v, ne[idx] = h[u], h[u] = idx ++;
}

node dfs(int u, int num) {
    node no, l;
    st[u] ++;
    col[u] = num;
    no.maxl = no.minl = val[u][num];
    for(int i = h[u];i != -1;i = ne[i]) {
        int j = e[i];
        if(st[u] != st[j]) {
            l = dfs(j, num^1);
            no.maxl = max(no.maxl, l.maxl);
            no.minl = min(no.minl, l.minl);
        }
        else if(col[u] == col[j])
            has_ans = 0;
    }
    return no;
}

int minl[N<<2], sizel[N<<2];

void pushup(int rt) {
    minl[rt] = min(minl[rt<<1], minl[rt<<1|1]);
    sizel[rt] = sizel[rt<<1] + sizel[rt<<1|1];
}

void build(int l, int r, int rt) {
    if(l ==r) {
        minl[rt] = 1e9+10;
        sizel[rt] = 0;
        return;
    }
    int m = (l + r) >> 1;
    build(lson); build(rson);
    pushup(rt);
}

void update(int l, int r, int rt, int id, int num) {
    if(l == r) {
        sizel[rt] = 1;
        minl[rt] = num;
        return ;
    }
    int m = (l + r) >> 1;
    if(id <= m) update(lson, id, num);
    else update(rson, id, num);
    pushup(rt);
}

int query_min(int l, int r, int rt, int num) {
    if(l == r) return minl[rt];
    int m = (l + r) >> 1;
    if(num <= m) return query_min(lson, num);
    else return query_min(rson, num);
}

int main() {
    int t;
    int x, y;
    scanf("%d", &t);
    for(int Case = 1;Case <= t;Case ++) {
        scanf("%d%d", &n, &m);
        init();
        while(m --) {
            scanf("%d%d", &x, &y);
            add(x, y); add(y, x);
        }
        for(int i = 1;i <= n;i ++)
            scanf("%d%d", &val[i][0], &val[i][1]);

        int Id = 0;
        for(int i = 1;i <= n;i ++) {
            if(st[i] == 0) {
                auto L = dfs(i, 1);
                L.id = ++ Id;
                v.push_back(L);
                L = dfs(i, 0);
                L.id = Id;
                v.push_back(L);
            }
        }

        if(has_ans == 0) {
            printf("Case %d: IMPOSSIBLE\n", Case);
            continue;    
        }

        int ans = 1e9+10;
        sort(v.begin(), v.end());

        build(1, Id, 1);
        for(auto vit : v)   {
            int num = query_min(1, Id, 1, vit.id);
            update(1, Id, 1, vit.id, vit.minl);
            if(sizel[1] == Id) {
                ans = min(ans, vit.maxl - minl[1]);
            }
            if(num != 1e9+10 && num > vit.minl)
                update(1, Id, 1, vit.id, num);
        }
        printf("Case %d: %d\n", Case, ans);
    }
    return 0;
}    

前两天比赛写了一个类似的题

2020ccpc秦皇岛 D - Exam Results

这个题也是用来类似的思路 从小到大枚举最大值 用数据结构维护当前状态 去更新答案