题意:
给你一个n个点m条边的图,你可以设置每条边的流量,现在要求每个点都得到s[i]的流量,问方案?
题解:
初看,没法做。
肯定是要转换了,我们发现,原图是个连通图,那么我们缩一下边,缩成一棵树还是联通的,可以猜测这样是等价的。
实际上是可以证明的,假如原图有一条边连着u, v,流量是c,那么在生成树上,我们可以等价成把u 到v的路径上的流量加c即可。
现在变成了树,题目就好做多了,对于一颗子树,他其实可以等价成一个点,需要的流量就是子树中所有点需要的流量之和。
那么连向这个子树的边流量就设置成这个子树的流量即可。
判断是否可行的时候,只要判断所有节点流量和是否为0即可。
代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <bitset>
#include <map>
#include <vector>
#include <stack>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#ifdef LOCAL
#define debug(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define debug(x) 1;
#endif
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define lson id<<1,l,mid
#define rson id<<1|1,mid+1,r
#define lowbit(x) x&-x
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> pii;
const ll MOD = 1e9 + 7;
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 2e5 + 5;
struct Edge {
int u, v, nxt, id;
} E[MAXN * 2], e[MAXN];
int head[MAXN], tot;
int s[MAXN];
void add (int x, int y, int id) {
E[tot++] = {x, y, head[x], id};
head[x] = tot - 1;
}
int par[MAXN];
int Find (int x) {
return x == par[x] ? x : par[x] = Find (par[x]);
}
int Union (int x, int y) {
int xx = Find (x), yy = Find (y);
if (xx != yy) {
par[xx] = yy;
return 1;
}
return 0;
}
int d[MAXN];
int ans[MAXN];
void dfs (int now, int par) {
int tot = s[now];
for (int i = head[now]; ~i; i = E[i].nxt) {
int v = E[i].v;
if (v == par) continue;
dfs (v, now);
ans[abs(E[i].id)] = E[i].id / abs(E[i].id) * d[v];
tot += d[v];
}
d[now] = tot;
}
int main() {
#ifdef LOCAL
freopen ("input.txt", "r", stdin);
#endif
int n;
scanf ("%d", &n);
memset(head, -1, sizeof(head));
for (int i = 1; i <= n; i++) par[i] = i;
for (int i = 1; i <= n; i++) scanf ("%d", &s[i]);
int m;
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf ("%d %d", &x, &y);
e[i] = {x, y, 0, i};
}
for (int i = 1; i <= m; i++)
if (Union (e[i].u, e[i].v) ) {
add (e[i].u, e[i].v, e[i].id);
add (e[i].v, e[i].u, -e[i].id);
}
dfs (1, 0);
int f = 0;
for (int i = head[1]; ~i; i = E[i].nxt)
f += ans[abs(E[i].id)] * (E[i].id / abs(E[i].id));
if(-f != s[1]) puts("Impossible");
else {
puts("Possible");
for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
}
return 0;
}