补题

Prefix Code
题意：给出N个字符串，如果有字符串是其他字符串的前缀则输出”No"，反则输出“Yes"。
思路：字典树板题，先把所有字符串插入字典树，新开的每个节点的权值++，然后查询每个字符串，如歌当前字符串的最后一个节点权值大于1，则输出“No"，反则输出”Yes"。

AC代码

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 20;
int w[maxn], tire[maxn][10], cnt;
void inser(char *s)
{
    int n = strlen(s), rt = 0;
    for (int i = 0; i < n; i++)
    {
        int id = s[i] - '0';
        if (!tire[rt][id])
            tire[rt][id] = ++cnt;
        rt = tire[rt][id];
        w[rt]++;
    }
    
}
int f(char *s)
{
    int n = strlen(s), rt = 0;
    for (int i = 0; i < n; i++)
    {
        int id = s[i] - '0';
        if (tire[rt][id])
            rt = tire[rt][id];
        else
            return 1;
    }
    return w[rt];
}
char s[10005][25];
int main()
{
    int t, ca = 0;
    scanf("%d", &t);
    while (t--)
    {
        memset(w, 0, sizeof w);
        memset(tire, 0, sizeof tire);
        int n;
        cnt = 0;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
        {
            scanf("%s", s[i]), inser(s[i]);
        }
        bool flag = true;
        for (int i = 1; i <= n; i++)
        {
            if (f(s[i]) > 1)
            {
                flag = false;
                break;
            }
        }
        if (flag)
            printf("Case #%d: Yes\n", ++ca);
        else
            printf("Case #%d: No\n", ++ca);
    }
    return 0;
}

Spanning Tree Removal
题意：给n个点，最多可以删多少个生成树
思路：构造题，n个点最多可以构造的生成树数量是有限，找到规律是（n/2）个，可以发现构造Z字形的生成树是可以最多的，然后把生成树的边画出来可以发现互相交替。

AC代码

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 20;
int a[1005];
int main()
{
    int t, ca = 0;
    scanf("%d", &t);
    while (t--)
    {
        int n, w;
        scanf("%d", &n);
        w = n / 2;
        printf("Case #%d: %d\n", ++ca, w);
        a[1] = 1;
        int k = 1, s = 0;
        for (int i = 2; i <= n; i++)
        {
            if (i % 2 == 0)
                a[i] = ++k;
            else
                a[i] = n - s++;
        }
        //puts(" ");
        while (w--)
        {
            for (int i = 1; i < n; i++)
            {
                printf("%d %d\n", a[i], a[i + 1]);
            }
            //puts("");
            for (int i = 1; i <= n; i++)
            {
                if (a[i] + 1 > n)
                    a[i] = 1;
                else
                    a[i]++;
            }
        }
    }
    return 0;
}

Cave Escape
题意
给一个二维矩阵压缩成一维的递推式，然后让求从起点到终点的最大价值。
思路：可以想到最大生成树。

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 20;
void read(int &v)
{
    int k = 1;
    v = 0;
    int c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            k = 0;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
        v = (v << 3) + (v << 1) + (c - 48), c = getchar();
    if (k == 0)
        v = -v;
}
struct node
{
    int a, b, w;
} edge[maxn * 2];

int x[maxn], pre[maxn];
vector< pair<int, int> > tong[10001];
void init(int n)
{
    for (int i = 0; i <= n; i++)
        pre[i] = i;
}
int f(int x)
{
    if (x != pre[x])
        pre[x] = f(pre[x]);
    return pre[x];
}
void krusal(int n, int m, int ca)
{
    ll ans = 0;
    int ct = 0;
    for (int i = m; i >= 0; i--)
    {
        int k = tong[i].size();
        for (int j = 0; j < k; j++)
        {
            int a = tong[i][j].first, b = tong[i][j].second;
            int x = f(a), y = f(b);
            if (x != y)
            {
                pre[x] = y;
                ans += i;
                ct++;
            }
            if (ct == n)
                break;
        }
        if (ct == n)
            break;
    }
    printf("Case #%d: %lld\n", ca, ans);
}
int main()
{
    int t, ca = 0;
    scanf("%d", &t);
    while (t--)
    {
        int n, m, a, b, c, d, cnt = 0;
        int x1, x2, A, B, C, P, maxx = 10001;
        scanf("%d %d %d %d %d %d", &n, &m, &a, &b, &c, &d);
        scanf("%d %d %d %d %d %d", &x[1], &x[2], &A, &B, &C, &P);
        pre[1] = 1, pre[2] = 2;
        for (int i = 0; i <= maxx; i++)
            tong[i].clear();
        for (int i = 3; i <= n * m; i++)
        {
            x[i] = (A * x[i - 1] + B * x[i - 2] + C) % P;
            pre[i] = i;
        }
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                int f = (i - 1) * m + j;
                if (i + 1 <= n)
                {
                    edge[++cnt] = {f, f + m, (x[(i - 1) * m + j]) * (x[i * m + j])};
                    tong[edge[cnt].w].push_back(make_pair(f, f + m));
                    maxx = max(maxx, edge[cnt].w);
                }
                if (j + 1 <= m)
                {
                    edge[++cnt] = {f, f + 1, (x[(i - 1) * m + j]) * (x[(i - 1) * m + j + 1])};
                    tong[edge[cnt].w].push_back(make_pair(f, f + 1));
                    maxx = max(maxx, edge[cnt].w);
                }
            }
        }
        krusal(n * m, maxx, ++ca);
    }
    return 0;
}

	

Color Graph
题意：给n个点，m条边的简单图，求这个图最多可以染多少条边，使染色的边构成的图不存在奇数环。
思路：二分图的性质就是不存在奇数环，所以可以枚举点，分为两个集合，然后开始枚举两边的集合进行染色，判断最多可以有多少条边，显然两个集合染色是不可能存在奇数环。

AC代码

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int link[25][25];
vector<int> f, s;
int solve(int n, int m)
{
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (link[f[i]][s[j]])
                ans++;
        }
    }
    return ans;
}
int main()
{
    int t, ca = 0;
    scanf("%d", &t);
    while (t--)
    {
        memset(link, 0, sizeof link);
        int n, m, u, v, ans = 0;
        scanf("%d %d", &n, &m);
        for (int i = 1; i <= m; i++)
        {
            scanf("%d %d", &u, &v);
            link[u][v] = link[v][u] = 1;
        }
        for (int i = 0; i < (1 << n); i++)
        {
            f.clear(), s.clear();
            for (int j = 0; j < n; j++)
            {
                if ((i >> j) & 1)
                {
                    f.push_back(j + 1);
                }
                else
                {
                    s.push_back(j + 1);
                }
            }
            ans = max(ans, solve(f.size(), s.size()));
        }
        printf("Case #%d: %d\n", ++ca, ans);
    }
    return 0;
}