Codeforces Round #523 (Div. 2) E.Politics

Codeforces传送门

洛谷传送门

题目描述

There are $n$ cities in the country.

Two candidates are fighting for the post of the President. The elections are set in the future, and both candidates have already planned how they are going to connect the cities with roads. Both plans will connect all cities using $n-1$ roads only. That is, each plan can be viewed as a tree. Both of the candidates had also specified their choice of the capital among $n$ cities ( $x$ for the first candidate and $y$ for the second candidate), which may or may not be same.

Each city has a potential of building a port (one city can have at most one port). Building a port in $i$ -th city brings $a_i$ amount of money. However, each candidate has his specific demands. The demands are of the form:

• $k$ $x$ , which means that the candidate wants to build exactly $x$ ports in the subtree of the $k$ -th city of his tree (the tree is rooted at the capital of his choice).

Find out the maximum revenue that can be gained while fulfilling all demands of both candidates, or print $-1$ if it is not possible to do.

It is additionally guaranteed, that each candidate has specified the port demands for the capital of his choice.

输入输出格式

输入格式：

The first line contains integers $n$ , $x$ and $y$ ( $1\le n\le 500$, $1\le x,y\le n$) — the number of cities, the capital of the first candidate and the capital of the second candidate respectively.

Next line contains integers $a_1,a_2,\dots ,a_n$( $1\le a_i\le 100000$ ) — the revenue gained if the port is constructed in the corresponding city.

Each of the next $n-1$ lines contains integers $u_i$ and $ v_i$ ( $1\le u_i,v_i\le n$, $u_i̸=v_i$ ), denoting edges between cities in the tree of the first candidate.

Each of the next $n-1$ lines contains integers $u_i^{\prime }$ and $v_i^{\prime }$ ( $1\le u_i^{\prime },v_i^{\prime }\le n$, $u_i^{\prime }̸=v_i^{\prime }$ ), denoting edges between cities in the tree of the second candidate.

Next line contains an integer $q_1$ ( $1\le q_1\le n$), denoting the number of demands of the first candidate.

Each of the next $q_1$ lines contains two integers $k$ and $x$ ( $1\le k\le n$ , $1\le x\le n$ ) — the city number and the number of ports in its subtree.

Next line contains an integer $q_2$ ( $1\le q_2\le n$ ), denoting the number of demands of the second candidate.

Each of the next $q_2$ lines contain two integers $k$ and $x$ ( $1\le k\le n$ , $1\le x\le n$ ) — the city number and the number of ports in its subtree.

It is guaranteed, that given edges correspond to valid trees, each candidate has given demand about each city at most once and that each candidate has specified the port demands for the capital of his choice. That is, the city $x$ is always given in demands of the first candidate and city $y$ is always given in the demands of the second candidate.

输出格式：

Print exactly one integer — the maximum possible revenue that can be gained, while satisfying demands of both candidates, or -1 if it is not possible to satisfy all of the demands.

输入输出样例

输入样例#1：

4 1 2
1 2 3 4
1 2
1 3
3 4
1 2
2 3
1 4
2
1 3
4 1
1
2 3

输出样例#1：

9

输入样例#2：

5 1 1
3 99 99 100 2
1 2
1 3
3 4
3 5
1 3
1 2
2 4
2 5
2
1 2
3 1
2
1 2
2 1

输出样例#2：

198

输入样例#3：

4 1 2
1 2 3 4
1 2
1 3
3 4
2 1
2 4
4 3
1
1 4
2
4 1
2 4

输出样例#3：

-1

说明

In the first example, it is optimal to build ports in cities $2$ , $3$ and $4$ , which fulfills all demands of both candidates and gives revenue equal to $2+3+4=9$ .

In the second example, it is optimal to build ports in cities $2$ and $3$ , which fulfills all demands of both candidates and gives revenue equal to $99+99=198$ .

In the third example, it is not possible to build ports in such way, that all demands of both candidates are specified, hence the answer is $-1$.

解题分析

这道题费用流很明显， 主要是怎么建图。

我们可以直接按题目要求建出两棵树， 每个点分成两个节点， 中间连下界为$li{m}_i$， 上界为$li{m}_i$（如果没有限制直接连成$INF$）， 然后两棵树对应节点连流量为$1$， 费用为收益的边， 跑最大费用可行流， 判断是否满流即可。

代码如下：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <queue>
#define R register
#define IN inline
#define W while
#define gc getchar()
#define MX 2050
#define INF 1e8
template <class C>
IN void in(C &x)
{
    x = 0; R char c = gc;
    for (; !isdigit(c); c = gc);
    for (;  isdigit(c); c = gc)
    x = (x << 1) + (x << 3) + c - 48;
}
template <class C> IN C max(C a, C b) {return a > b ? a : b;}
template <class C> IN C min(C a, C b) {return a < b ? a : b;}
bool inq[MX];
int S, T, n, q1, q2, ct, cnt, flow, sum, x, y, tot, tar;
int head[MX], h1[MX], h2[MX], dis[MX], pre[MX], del[MX], deg[MX];
int lim1[MX], lim2[MX], pos1[MX], pos2[MX], val[MX];
struct Edge {int to, fl, len, nex;} edge[MX * 10];
struct EDGE {int to, nex;} e[MX * 10];
IN void add(R int from, R int to, R int fl, R int cost)
{
    edge[++cnt] = {to, fl, cost, head[from]}, head[from] = cnt;
    edge[++cnt] = {from, 0, -cost, head[to]}, head[to] = cnt;
}
IN void add1(R int from, R int to) {e[++ct] = {to, h1[from]}, h1[from] = ct;}
IN void add2(R int from, R int to) {e[++ct] = {to, h2[from]}, h2[from] = ct;}
namespace MCMF
{
    std::queue <int> q;
    IN bool SPFA()
    {
        std::memset(dis, 63, sizeof(dis));
        dis[S] = 0, del[S] = INF, q.push(S);
        R int now;
        W (!q.empty())
        {
            now = q.front(); q.pop();
            for (R int i = head[now]; ~i; i = edge[i].nex)
            {
                if (dis[edge[i].to] > dis[now] + edge[i].len && edge[i].fl)
                {
                    dis[edge[i].to] = dis[now] + edge[i].len;
                    pre[edge[i].to] = i;
                    del[edge[i].to] = min(del[now], edge[i].fl);
                    if (!inq[edge[i].to]) inq[edge[i].to] = true, q.push(edge[i].to);
                }
            }
            inq[now] = false;
        }
        return dis[T] < INF;
    }
    IN void update()
    {
        R int now = T, pr;
        sum -= del[T] * dis[T], flow += del[T];
        W (now ^ S)
        {
            pr = pre[now];
            edge[pr].fl -= del[T], edge[pr ^ 1].fl += del[T];
            now = edge[pr ^ 1].to;
        }
    }
    IN void init() {W (SPFA()) update();}
}
void DFS1(R int now, R int fa)
{
    if (lim1[now]) deg[now] -= lim1[now], deg[now + n] += lim1[now];
    else add(now, now + n, INF, 0);
    add(now + n, now + tot + n, 1, val[now]);
    for (R int i = h1[now]; i; i = e[i].nex)
    {
        if (e[i].to == fa) continue;
        add(now + n, e[i].to, INF, 0);
        DFS1(e[i].to, now);
    }
}
void DFS2(R int now, R int fa)
{
    if (lim2[now]) deg[now + tot + n] -= lim2[now], deg[now + tot] += lim2[now];
    else add(now + tot + n, now + tot, INF, 0);
    for (R int i = h2[now]; i; i = e[i].nex)
    {
        if (e[i].to == fa) continue;
        add(e[i].to + tot, now + tot + n, INF, 0);
        DFS2(e[i].to, now);
    }
}
int main(void)
{
    int a, b;
    std::memset(head, cnt = -1, sizeof(head));
    in(n), in(x), in(y); tot = n << 1;
    for (R int i = 1; i <= n; ++i) in(val[i]), val[i] = -val[i];
    for (R int i = 1; i <  n; ++i)
    {
        in(a), in(b);
        add1(a, b), add1(b, a);
    }
    for (R int i = 1; i < n; ++i)
    {
        in(a), in(b);
        add2(a, b), add2(b, a);
    }
    in(q1);
    for (R int i = 1; i <= q1; ++i)
    {
        in(a), in(b);
        lim1[a] = b;
    }
    in(q2);
    for (R int i = 1; i <= q2; ++i)
    {
        in(a), in(b);
        lim2[a] = b;
    }
    S = 4 * n + 1, T = 4 * n + 2;
    DFS1(x, 0); DFS2(y, 0);
    for (R int i = 1; i <= 4 * n; ++i)
    {
        if (deg[i] > 0) add(S, i, deg[i], 0), tar += deg[i];
        else add(i, T, -deg[i], 0);
    }
    add(y + tot, x, INF, 0);
    MCMF::init();
    printf("%d", flow == tar ? sum : -1);
}