深海机器人问题 【网络流24题】

 

 

 思路

　　和方格取数差不多的一道题

　　只是输入有点恶心

　　然而他好像提示了怎么输出

　　之后就是建图标准最大费用最大流了

　　不知道为什么spfa的最大流T了一个点

　　难道说数据这么丧心病狂吗

　　zkw的话倒是50ms就跑完了

CODE

#include <bits/stdc++.h>
#define dbg(x) cout << #x << "=" << x << endl

using namespace std;
typedef long long LL;
                   
template<class T>inline void read(T &res)
{
    char c;T flag=1;
    while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
    while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

const int MAXN = 2e3 + 5;
const int inf = 0x3f3f3f3f;

int N, M;

struct Edge{
    int to, val, cost;
    Edge *next, *ops;
    Edge(int to, int val, int cost, Edge *next): to(to), val(val), cost(cost), next(next){}
};

Edge *head[MAXN << 1];

void BuildGraph(int u, int v, int w, int c) {
    head[u] = new Edge(v, w, c, head[u]);
    head[v] = new Edge(u, 0, -c, head[v]);
    head[u]->ops = head[v]; head[v]->ops = head[u];
}

namespace zkw{
    int s, t, ans, res;
    int dis[MAXN << 1];
    bool vis[MAXN << 1];
    bool Spfa() {
        memset(vis, false, sizeof vis);
        memset(dis, 0x3f, sizeof dis);
        deque<int> q;
        q.push_back(s);
        vis[s] = true; dis[s] = 0;
        while (!q.empty()) {
            int u = q.front(); q.pop_front(); vis[u] = false;
            for (Edge *e = head[u]; e; e = e->next) {
                int v = e->to;
                if (e->val > 0 && dis[u] + e->cost < dis[v]) {
                    dis[v] = dis[u] + e->cost;
                    if (!vis[v]) {
                        vis[v] = true;
                        if (!q.empty() && dis[v] < dis[q.front()]) q.push_front(v);
                        else q.push_back(v);
                    }
                }
            }
        }
        return dis[t] < inf;
    }

    int Dfs(int u, int flow) {
        if (u == t) {
            vis[u] = true;
            res += flow;
            return flow;
        }
        int used = 0; vis[u] = true;
        for (Edge *e = head[u]; e; e = e->next) {//当前弧就不加了
            int v = e->to;
            if ((!vis[v] || v == t) && e->val && dis[u] + e->cost == dis[v]) {
                int mi = Dfs(v, min(e->val, flow - used));
                if (mi) {
                    e->val -= mi;
                    e->ops->val += mi;
                    ans += e->cost * mi;
                    used += mi;
                }
                if (used == flow) break;
            }
        }
        return used;
    }

    void Work() {
        res = 0; ans = 0;
        while (Spfa()) {
            vis[t] = true;
            while (vis[t]) {
                memset(vis, false, sizeof vis);
                Dfs(s, inf);
            }
        }
    }
}

int A, B, n, m;
int table[20][20];
int times = 0;

signed main()  
{
    //freopen("data.txt", "r", stdin);
    read(A); read(B);
    read(n); read(m);
    for ( int i = 0; i <= n; ++i ) {
        for ( int j = 0; j <= m; ++j ) {
            table[i][j] = ++times;
        }
    }
    int x;
    int s, t;
    s = 0, t = (n + 1) * (m + 1) + 1;
    zkw::s = s, zkw::t = t;
    for ( int i = 0; i <= n; ++i ) {
        for ( int j = 0; j <= m - 1; ++j ) {
            read(x);
            BuildGraph(table[i][j], table[i][j+1], inf, 0);
            BuildGraph(table[i][j], table[i][j + 1], 1, -x);
        }
    }
    for ( int j = 0; j <= m; ++j ) {
        for ( int i = 0; i <= n - 1; ++i ) {
            read(x);
            BuildGraph(table[i][j], table[i+1][j], inf, 0);
            BuildGraph(table[i][j], table[i+1][j], 1, -x);
        }
    }
    for ( int i = 1; i <= A; ++i ) {
        int x, y, num;
        read(num); read(x); read(y);
        BuildGraph(s, table[x][y], num, 0);
    }
    for ( int i = 1; i <= B; ++i ) {
        int x, y, num;
        read(num); read(x); read(y);
        //dbg(num);
        BuildGraph(table[x][y], t, num, 0);
    }
    zkw::Work();
    int ans = -zkw::ans;
    cout << ans << endl;
    return 0;
}