Decreasing Debts CodeForces - 1266D（思维）

There are n people in this world, conveniently numbered 1 through n. They are using burles to buy goods and services. Occasionally, a person might not have enough currency to buy what he wants or needs, so he borrows money from someone else, with the idea that he will repay the loan later with interest. Let d(a,b) denote the debt of a towards b, or 0 if there is no such debt.

Sometimes, this becomes very complex, as the person lending money can run into financial troubles before his debtor is able to repay his debt, and finds himself in the need of borrowing money.

When this process runs for a long enough time, it might happen that there are so many debts that they can be consolidated. There are two ways this can be done:

Let d(a,b)>0 and d(c,d)>0 such that a≠c or b≠d. We can decrease the d(a,b) and d(c,d) by z and increase d(c,b) and d(a,d) by z, where 0<z≤min(d(a,b),d(c,d)).
Let d(a,a)>0. We can set d(a,a) to 0.
The total debt is defined as the sum of all debts:

Σd=∑a,bd(a,b)
Your goal is to use the above rules in any order any number of times, to make the total debt as small as possible. Note that you don’t have to minimise the number of non-zero debts, only the total debt.

Input
The first line contains two space separated integers n (1≤n≤105) and m (0≤m≤3⋅105), representing the number of people and the number of debts, respectively.

m lines follow, each of which contains three space separated integers ui, vi (1≤ui,vi≤n,ui≠vi), di (1≤di≤109), meaning that the person ui borrowed di burles from person vi.

Output
On the first line print an integer m′ (0≤m′≤3⋅105), representing the number of debts after the consolidation. It can be shown that an answer always exists with this additional constraint.

After that print m′ lines, i-th of which contains three space separated integers ui,vi,di, meaning that the person ui owes the person vi exactly di burles. The output must satisfy 1≤ui,vi≤n, ui≠vi and 0<di≤1018.

For each pair i≠j, it should hold that ui≠uj or vi≠vj. In other words, each pair of people can be included at most once in the output.

Examples
Input
3 2
1 2 10
2 3 5
Output
2
1 2 5
1 3 5
Input
3 3
1 2 10
2 3 15
3 1 10
Output
1
2 3 5
Input
4 2
1 2 12
3 4 8
Output
2
1 2 12
3 4 8
Input
3 4
2 3 1
2 3 2
2 3 4
2 3 8
Output
1
2 3 15
Note
In the first example the optimal sequence of operations can be the following:

Perform an operation of the first type with a=1, b=2, c=2, d=3 and z=5. The resulting debts are: d(1,2)=5, d(2,2)=5, d(1,3)=5, all other debts are 0;
Perform an operation of the second type with a=2. The resulting debts are: d(1,2)=5, d(1,3)=5, all other debts are 0.
In the second example the optimal sequence of operations can be the following:

Perform an operation of the first type with a=1, b=2, c=3, d=1 and z=10. The resulting debts are: d(3,2)=10, d(2,3)=15, d(1,1)=10, all other debts are 0;
Perform an operation of the first type with a=2, b=3, c=3, d=2 and z=10. The resulting debts are: d(2,2)=10, d(3,3)=10, d(2,3)=5, d(1,1)=10, all other debts are 0;
Perform an operation of the second type with a=2. The resulting debts are: d(3,3)=10, d(2,3)=5, d(1,1)=10, all other debts are 0;
Perform an operation of the second type with a=3. The resulting debts are: d(2,3)=5, d(1,1)=10, all other debts are 0;
Perform an operation of the second type with a=1. The resulting debts are: d(2,3)=5, all other debts are 0.
思路：题目描述的花里胡哨，但是思路还是挺好想的。每一个人，要么亏了，要么赚了，要么不亏不赚。最后我们将亏的人指向赚的人（合法范围内）。并查集来代表他们是否在一个利益圈内。
代码如下：

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

const int maxx=1e5+100;
struct node{
	int x,y;
	ll z;
	node(int a,int b,ll c)
	{
		x=a,y=b,z=c;
	}
};
ll val[maxx];
int f[maxx];
int n,m;

inline void init()
{
	for(int i=1;i<=n;i++) f[i]=i;
	memset(val,0,sizeof(val));
}
inline int getf(int u)
{
	return u==f[u]?u:f[u]=getf(f[u]);
}
inline void merge(int u,int v)
{
	int t1=getf(u);
	int t2=getf(v);
	if(t1!=t2) f[t1]=t2;
}
int main()
{
	scanf("%d%d",&n,&m);
	init();
	int x,y;ll z;
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%lld",&x,&y,&z);
		val[x]-=z;
		val[y]+=z;
		merge(x,y);
	}
	vector<int> yl,ks;
	yl.clear(),ks.clear();
	for(int i=1;i<=n;i++)
	{
		if(val[i]>0) yl.push_back(i);
		if(val[i]<0) ks.push_back(i);
	}
	queue<node> q;
	for(int i=0;i<ks.size();i++)
	{
		for(int j=0;j<yl.size();j++)
		{
			if(getf(ks[i])==getf(yl[j]))
			{
				ll z=min(-val[ks[i]],val[yl[j]]);
				q.push(node(ks[i],yl[j],z));
				val[ks[i]]+=z;
				val[yl[j]]-=z;
				if(val[yl[j]]==0) 
				{
					yl.erase(yl.begin()+j);
					j--;
				}
			}
			if(val[ks[i]]==0) break;
		}
	}
	cout<<q.size()<<endl;
	while(q.size())
	{
		node a=q.front();
		q.pop();
		cout<<a.x<<" "<<a.y<<" "<<a.z<<endl;
	}
	return 0;
}

努力加油a啊，(^o)/~