2019 icpc 上海 E Cave Escape（最大生成树）

最新推荐文章于 2021-09-05 10:53:04 发布

邵光亮

最新推荐文章于 2021-09-05 10:53:04 发布

阅读量514

点赞数

分类专栏：图论——最小生成树

本文链接：https://blog.csdn.net/qq_43627087/article/details/104346011

版权

图论——最小生成树专栏收录该内容

4 篇文章 0 订阅

订阅专栏

在这里插入图片描述

题意：

给定一个 $n * m$ 的矩阵，第 $i$ 行第 $j$ 列的元素价值为 $v_{ij}$ 从 $(i, j)$ 可移动到边相邻的点 $(x, y)$ 。
如果 $(i, j)$ 已访问过，本次移动的收益为 $0$ , 否则收益为 $v_{ij}*v_{xy}$ 。

现要从 $S_{R},S_{C}$ 移动到 $T_{R},T_{C}$ ，求最大代价。

矩阵元素权值的生成过程如下：

给定 $X_{1},X_{2},A,B,C,P$
$i∈[3,n*m]，X_{i}=(AX_{i-1}+BX_{i-2}+C) mod P$
$i∈[1,n],∀j∈[1,m],v_{ij}=X_{(i-1)*m+j}$

将元素看成点，边相邻的元素对应的点之间连边，边权为元素权值之积。
要使收益最大，显然要访问所有的点，最终会得到 $n m - 1$ 条边的边权之和的收益。
$n m - 1$ 条边和所有的点形成一棵树，故在该图上求最大生成树即可。

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n, m) printf("%d %d\n", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sc(n) scanf("%c", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define ss(str) scanf("%s", str)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a, n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mod(x) ((x) % MOD)
#define gcd(a, b) __gcd(a, b)
#define lowbit(x) (x & -x)
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret * 10 + ch - '0';
        ch = getchar();
    }
    return ret * sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
    if (a > 9)
        Out(a / 10);
    putchar(a % 10 + '0');
}

ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    return a * b / gcd(a, b);
}
///快速幂m^k%mod
ll qpow(ll a, ll b, ll mod)
{
    if (a >= mod)
        a = a % mod + mod;
    ll ans = 1;
    while (b)
    {
        if (b & 1)
        {
            ans = ans * a;
            if (ans >= mod)
                ans = ans % mod + mod;
        }
        a *= a;
        if (a >= mod)
            a = a % mod + mod;
        b >>= 1;
    }
    return ans;
}

struct edg
{
    int u, v, w;
    edg(int a = 0, int b = 0, int c = 0) : u(a), v(b), w(c) {}
};

const int N = 1e6 + 5;
const int M = 1e3 + 5;
const int W = 1e4 + 5;
const int dx[] = {0, 1}, dy[] = {1, 0};
int t, n, m, sr, sc, tr, tc;
int a, b, c, p, x[N], v[M][M];
int cas, ct, ect, far[N], cnt[W];
edg g[N << 2], e[N << 2];
ll ans;

bool inb(int x, int y)
{
    return 1 <= x && x <= n && 1 <= y && y <= m;
}

int idx(int x, int y)
{
    return (x - 1) * m + y;
}

void cnt_sort()
{
    mem(cnt, 0);
    rep(i, 1, ct)
    {
        cnt[g[i].w]++;
    }
    rep(i, 1, W - 1)
    {
        cnt[i] += cnt[i - 1];
    }
    for (int i = ct; i; i--)
        e[cnt[g[i].w]--] = g[i];
}

int find(int x)
{
    return x == far[x] ? x : far[x] = find(far[x]);
}

ll kruskal()
{
    if (n * m == 1)
        return 0;
    cnt_sort();
     ect = ans = 0;
    for (int i = ct; i; i--)
    {
        int fu = find(e[i].u), fv = find(e[i].v);
        if (fu == fv)
            continue;
        far[fu] = fv, ect++, ans += e[i].w;
        if (ect == n * m - 1)
            break;
    }
    return ans;
}

int main()
{
    sd(t);
    while (t--)
    {
        sdd(n, m);
        sdd(sr, sc);
        sdd(tr, tc);
        sdd(x[1], x[2]);
        sddd(a, b, c);
        sd(p);
        far[1] = 1, far[2] = 2, ct = 0;
        rep(i, 3, n * m)
        {
            far[i] = i;
            x[i] = (a * x[i - 1] + b * x[i - 2] + c) % p;
        }
        rep(i, 1, n)
        {
            rep(j, 1, m)
            {
                v[i][j] = x[(i - 1) * m + j];
            }
        }
        rep(i, 1, n)
        {
            rep(j, 1, m)
            {
                rep(k, 0, 1)
                {
                    int x = i + dx[k], y = j + dy[k];
                    if (!inb(x, y))
                        continue;
                    g[++ct] = edg(idx(i, j), idx(x, y), v[i][j] * v[x][y]);
                }
            }
        }
        printf("Case #%d: %lld\n", ++cas, kruskal());
    }
    return 0;
}