2021牛客多校6

H Hopping Rabbit[扫描线]

前队友曾经和我提过扫描线求面积并，当时尝试去学了然而并没有学会。这道题其实比一般的求面积并要简单，不需要离散化。

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
#define P pair<int,int>
int lazy[N << 2];  // 标记了这条线段出现的次数

struct node1 {
    int id;
    int minn;
} cl[N << 2];  

//上传
void pushdown(int rt){
    lazy[rt<<1|1] += lazy[rt];
    cl[rt<<1|1].minn += lazy[rt]; 
    lazy[rt<<1] += lazy[rt];
    cl[rt<<1].minn += lazy[rt];
    lazy[rt] = 0;
}
void pushup(int rt) {
    cl[rt] = cl[rt * 2].minn < cl[rt * 2 + 1].minn? cl[rt<<1]:cl[rt<<1|1];
}

void build(int rt, int l, int r) {
    cl[rt] = node1{l,0};
    if (r != l) {
        build(rt * 2, l, (l + r) / 2);
        build(rt * 2 + 1, (l + r) / 2 + 1, r);
    }
    return;
}

void update(int rt, int l, int r,int ql,int qr,int flag) {
    if (l == ql && r == qr) {
        lazy[rt] += flag;
        cl[rt].minn += flag;
        return;
    } else {
        pushdown(rt);
        int mid = (l+r)/2;
        if (ql <= mid) update(rt * 2 , l, mid, ql, min(qr,mid), flag);
        if (qr > mid) update(rt * 2+ 1, mid+1, r, max(mid+1,ql), qr, flag);
        pushup(rt);
    }
}

vector<P> era[N],nxt[N];
int main() {
    int d, n;
    int x1, y1, x2, y2;
    scanf("%d%d", &n,&d);
    for (int i = 0; i < n; i++) {
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
        x2--;y2--;
        x1 = (x1%d+d)%d;
        x2 = (x2%d+d)%d;
        y1 = (y1%d+d)%d;
        y2 = (y2%d+d)%d;
        if(x1 <= x2){
            era[x1].push_back(P{y1,y2});
            nxt[x2+1].push_back(P{y1,y2});
        }else{
            era[x1].push_back(P{y1,y2});
            era[0].push_back(P{y1,y2});
            nxt[x2+1].push_back(P{y1,y2});
        }
    }
    build(1, 0, d-1);       
    memset(lazy, 0, sizeof(lazy));
    int flag = 0;
    for (int i = 0; i < d; i++) {
        for(auto j:era[i]){
            if(j.first<=j.second) update(1,0,d-1,j.first,j.second,1);
            else {
                update(1,0,d-1,0,j.second,1);
                update(1,0,d-1,j.first,d-1,1);
            }
        }
        for(auto j:nxt[i]){
            if(j.first<=j.second) update(1,0,d-1,j.first,j.second,-1);
            else {
                update(1,0,d-1,0,j.second,-1);
                update(1,0,d-1,j.first,d-1,-1);
            }
        }
        if(cl[1].minn == 0){
            printf("YES\n%d %d",i,cl[1].id);
            flag = 1;
            break;
        }
    }
    if(!flag){
        cout<<"NO";
    }
    return 0;
}

J Defend Your Country[图论]

赛时被割点搞晕了，后来才知道稍微分析一下就可以发现连接奇数双连通分量的割点都一定不能选。
出题人：“大胆猜结论“

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6+6;
const int INF = 0x3f3f3f3f;
int n,m;
int dfn[N],low[N],sz[N],dfnn, root;
int w[N];
vector<int> mp[N];
int flag[N];
int res = INF;
void tarjan(int u){
	dfn[u] = low[u] = ++dfnn;
	sz[u] = 1;
//	int cnt = 1;
	for(auto v:mp[u]){
//		int v = e[i].to;
		if(!dfn[v]){
			tarjan(v);
			sz[u] += sz[v];
			if(low[v] >= dfn[u] && (sz[v]&1) ) flag[u] = 0;
			low[u] = min(low[u],low[v]); 
		}
		else low[u] = min(low[u],dfn[v]);
	}
	if(flag[u])
		res = min(res, w[u]); 
}

int main() {
    int t;
    cin >> t; 
    while (t--) {
        cin >> n >> m;
        ll ans = 0;
        dfnn = 0;
        for (int i = 1; i <= n; i++){
        	cin >> w[i];
        	ans += w[i];
        	flag[i] = 1;
        	dfn[i] = sz[i] = 0;
        	mp[i].clear(); 
        }  
        for (int i = 0,u,v; i < m; i++){
        	cin >> u >> v;
        	mp[u].push_back(v);
        	mp[v].push_back(u);
        }
        	
        for (int i = 1; i <= n; i++){
        	if(!dfn[i]){
        		res = INF;
        		tarjan(i);
        		if(sz[i]&1) ans -= 2*res;		
        	}
        }
        
        cout<<ans<<endl;
    }
    return 0;
}