acwing368 银河 强连通分量 来求 差分约束

大致思路就是 按差分约束建图 然后 如果成环的话 那就是 A >= B B >= C C >= A 所以 A = B = C ;如果不相等那就不成立 如果都成立的话按照缩点 来看环之间的关系 因为环中的值都一样 所以只要求出 环值*环中的数 就可以求值

#include<iostream>
#include<cstring>
#define IOS ios::sync_with_stdio(false)

using namespace std;

const int N = 2e5 + 10;
int n,m;

int head[N],to[N * 2],w[N * 2],last[N * 2],cnt,hs[N];
void add(int h[],int a,int b,int c){
	to[++cnt] = b;
	w[cnt] = c;
	last[cnt] = h[a];
	h[a] = cnt;
}

int dfn[N],low[N],belong[N],sta[N],flag[N],Size[N];
int top,times,scc_cnt;

void tarjan(int x){
	dfn[x] = low[x] = ++times;
	sta[++top] = x;flag[x] = 1;
	for(int i = head[x]; i != -1; i = last[i]){
		int j = to[i];
		if(!dfn[j]){
			tarjan(j);
			low[x] = min(low[x],low[j]);
		}else if(flag[j]){
			low[x] = min(low[x],dfn[j]);
		}
	}
	
	if(low[x] == dfn[x]){
		++scc_cnt;
		int y;
		do{
			y = sta[top--];
			belong[y] = scc_cnt;
			Size[scc_cnt]++;
			flag[y] = 0;
		}while(y != x);
	}
}

int dist[N];
int main(){
	IOS;
	memset(head,-1,sizeof head);
	memset(hs,-1,sizeof hs);
	cin >> n >> m;
	
	for(int i = 1; i <= n; i++){
		add(head,0,i,1);
	}
	
	for(int i = 1; i <= m; i++){
		int z,x,y;
		cin >> z >> x >> y;
		if(z == 1){
			add(head,x,y,0); // A <= B B <= A
			add(head,y,x,0);
		}else if(z == 2){ //A <= B - 1  dist[A] > dist[B] - 1
			add(head,x,y,1); // B >= A + 1
		}else if(z == 3){ // A >= B B <= A
			add(head,y,x,0);
		}else if(z == 4){ // A > B  B <= A - 1
			add(head,y,x,1);
		}else{ // A <= B
			add(head,x,y,0);
		}
	}
	
	tarjan(0);
	
	bool sucess = true;
	for(int i = 0; i <= n; i++){
		for(int j = head[i]; j != -1; j = last[j]){
			int k = to[j];
			if(belong[i] == belong[k]){
				if(w[j] > 0){
					sucess = false;
					break;
				}
			}else{
				add(hs,belong[i],belong[k],w[j]);
			}
		}
	}
	
	if(!sucess) cout << "-1" << endl;
	else{
		for(int i = scc_cnt; i >= 1; i--){
			for(int j = hs[i]; j != -1; j = last[j]){
				int k = to[j];
				if(dist[k] < dist[i] + w[j]){
					dist[k] = dist[i] + w[j];
				}
			}
		}
		
		long long sum = 0;
		for(int i = 1; i <= scc_cnt; i++){
			sum += 1ll * dist[i] * Size[i];
		}
		cout << sum << endl;
	}
	return 0;
}