2021牛客暑期多校训练营3

2021牛客暑期多校训练营3

B、Black and White

居然是最小生成树。

$n$行抽象成$n$个点，$m$列抽象成$m$个点，分别放在两个集合中。一个点$(i,j)$被染黑对应到两个集合$<i,j>$​之间连一条边。若一条边加入后如果不改变连通性，说明$<i,j>$间已经连通，即至少有$<i,k>,<p,k>,<p,j>$三条边，则此时这条边可以以代价0加入。

求最小生成树即可。

#include <bits/stdc++.h>
typedef long long ll;
const int MAXN = 5e3 + 10;
ll dis[MAXN << 1];
ll A[MAXN * MAXN];
int main()
{
    int n, m, a, b, c, d, p; scanf("%d%d%d%d%d%d%d", &n, &m, &a, &b, &c, &d, &p);
    A[0] = a;
    for (int i = 1; i <= n * m; ++i)
        A[i] = (A[i - 1] * A[i - 1] * b % p + A[i - 1] * c % p + d) % p;
    memset(dis, 0x3f, sizeof dis);
    dis[1] = -1;
    for (int i = 1; i <= m; ++i)
        dis[n + i] = std::min(dis[n + i], A[i]);
    ll ans = 0;
    for (int i = 1; i <= n + m - 1; ++i)
    {
        int t = -1;
        for (int j = 1; j <= n + m; ++j)
            if (dis[j] != -1 && (t == -1 || dis[j] < dis[t]))
                t = j;
        ans += dis[t]; dis[t] = -1;
        if (t <= n)
        {
            for (int j = 1; j <= m; ++j)
                dis[n + j] = std::min(dis[n + j], A[m * (t - 1) + j]);
        }
        else
        {
            for (int j = 1; j <= n; ++j)
                dis[j] = std::min(dis[j], A[m * (j - 1) + t - n]);
        }
    }
    printf("%lld\n", ans);
    return 0;
}

E、Math

IMO原题。

$\frac{x^2+y^2}{1+xy}$是完全平方数，记为$k^2$。

$(x,y)$​​​满足$\frac{x^2+y^2}{1+xy}=k^2$​​​​，那么$(y,k^{2}y-x)$​​​​也满足。

把所有满足$\frac{x^2+y^2}{1+xy}=k^2$的解塞到一个数组$a_k[]$里，观察有$a_k[1]=k,a_k[2]=k^3$。

$a_k[i]=k^2{a}_k[i-1]-a_k[i-2]$​​。把所有解打出来，记一下个数，之后跑前缀和搞定。

#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 1e6 + 10;
const ll INF = 1000000000000000000;
std::set < ll > alls;
int main()
{
    std::map < ll, ll > mp;
    mp[1]++; alls.insert(-1);
    for (ll i = 2; i <= MAXN; ++i)
    {
        ll p = i;
        if (i * i * i > INF) break;
        ll pp = i * i * i;
        mp[i * i * i]++; alls.insert(-i * i * i);
        for (int j = 2; ; ++j)
        {
            if (pp > (INF + p) / (i * i)) break;
            ll u = i * i * pp - p;
            if (u > INF) break;
            mp[u]++; alls.insert(-u);
            p = pp, pp = u;
        }
    }
    auto p = mp.begin();
    auto q = p; ++q;
    for ( ; q != mp.end(); ++q)
    {
        q -> second += p -> second;
        ++p;
    }
    int t; scanf("%d", &t);
    while (t--)
    {
        ll n; scanf("%lld", &n);
        printf("%lld\n", mp[-(*alls.lower_bound(-n))]);
    }
    return 0;
}

J、Counting Triangles

每个点计算黑边乘白边并求和。这样每个异色三角形都会被算两遍，总数减去二分之一的和即可。

我们队卡了好久，想通之后大骂sb题。

#include <bits/stdc++.h>
typedef long long ll;
namespace GenHelper
{
    unsigned z1, z2, z3, z4, b, u;
    unsigned get()
    {
        b = ((z1 << 6) ^ z1) >> 13;
        z1 = ((z1 & 4294967294U) << 18) ^ b;
        b = ((z2 << 2) ^ z2) >> 27;
        z2 = ((z2 & 4294967288U) << 2) ^ b;
        b = ((z3 << 13) ^ z3) >> 21;
        z3 = ((z3 & 4294967280U) << 7) ^ b;
        b = ((z4 << 3) ^ z4) >> 12;
        z4 = ((z4 & 4294967168U) << 13) ^ b;
        return (z1 ^ z2 ^ z3 ^ z4);
    }
    bool read()
    {
        while (!u) u = get();
        bool res = u & 1;
        u >>= 1;
        return res;
    }
    void srand(int x)
    {
        z1 = x;
        z2 = (~x) ^ 0x233333333U;
        z3 = x ^ 0x1234598766U;
        z4 = (~x) + 51;
        u = 0;
    }
}
using namespace GenHelper;
bool edge[8005][8005];
int main()
{
    int n, seed;
    scanf("%d%d", &n, &seed);
    srand(seed);
    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
            edge[j][i] = edge[i][j] = read();
    ll ans = 0;
    for (int i = 0; i < n; ++i)
    {
        int black = 0;
        for (int j = 0; j < n; ++j)
            if (edge[i][j] == 1 && i != j) ++black;
        ans += 1ll * black * (n - 1 - black);
    }
    printf("%lld\n", 1ll * n * (n - 1) * (n - 2) / 6 - (ans >> 1));
    return 0;
}

快一年没写博客，翻了翻去年的多校，发现还是一样菜。

不要问为什么没有多校1和2，问就是被课设折磨。