CS Academy Round #77 (Div. 2 only) C D

https://csacademy.com/contest/round-77/summary/

C
对矩阵从右往左做一个先后手的dp
dp[o][i][j]表示o玩家在从左边走到i行j列后可以取到的想要的最优解

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
//#include <ctime>
#include <bitset>
#include <assert.h>
using namespace std;
#define pb push_back
#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 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 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 ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000009 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  1e5+20;
const int maxm = 4e2+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}
int a[3][maxn];
ll dp[2][3][maxn];//0 min , 1 max
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n;
    sd(n);
    r1(i,2)r1(j,n)sd(a[i][j]),dp[1][i][j] = -1000000000000LL,dp[0][i][j] = 1000000000000LL;
    dp[0][2][n] = dp[1][2][n] = a[2][n];
    dp[0][1][n] = dp[1][1][n] = a[1][n] + a[2][n];
    for(int i=n-1;i;--i)
    {
        dp[0][1][i] = min(dp[0][1][i],dp[1][1][i+1] + a[1][i]);
        dp[0][1][i] = min(dp[0][1][i],dp[0][2][i+1] + a[1][i] + a[2][i]);
        dp[1][1][i] = max(dp[1][1][i],dp[0][1][i+1] + a[1][i]);
        dp[1][1][i] = max(dp[1][1][i],dp[1][2][i+1] + a[1][i] + a[2][i]);

        dp[0][2][i] = min(dp[0][2][i],dp[1][2][i+1] + a[2][i]);
        dp[0][2][i] = min(dp[0][2][i],dp[0][1][i+1] + a[2][i] + a[1][i]);
        dp[1][2][i] = max(dp[1][2][i],dp[0][2][i+1] + a[2][i]);
        dp[1][2][i] = max(dp[1][2][i],dp[1][1][i+1] + a[1][i] + a[2][i]);
//        printf("0 1 %d = %d\n",i,dp[0][1][i]);
//        printf("1 1 %d = %d\n",i,dp[1][1][i]);
//        printf("0 2 %d = %d\n",i,dp[0][2][i]);
//        printf("1 2 %d = %d\n",i,dp[1][2][i]);

    }
    ll ans = dp[0][1][1];
    lansn();
    return 0;
}

D

考虑到LCP就是串前面最长的重合部分
所以直接用trie做
假如当前节点有x个串经过
那么这个节点可以产生x*(x-1)次贡献

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
//#include <ctime>
#include <bitset>
#include <assert.h>
using namespace std;
#define pb push_back
#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 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 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 ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000009 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  1e6+20;
const int maxm = 4e2+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}
int trie[maxn][26];
int val[maxn];
int sz = 1;
char s[maxn];
void ins()
{
    int len = strlen(s+1);
    int u = 0;
    for(int i=1;i<=len;++i)
    {
        int ch = s[i] - 'a';
        if(trie[u][ch]==-1)trie[u][ch] = sz++;
        u = trie[u][ch];
        ++val[u];
    }
}
ll ans;
ll dfs(int u)
{
    if(u&&val[u]>=2)ans += 1LL*val[u]*(val[u]-1);
    for(int i=0;i<26;++i)
    {
        int nt = trie[u][i];
        if(nt!=-1)dfs(nt);
    }
}
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL
    mst(trie,-1);
    int n;
    sd(n);
    r1(i,n)
    {
        ss(s+1);
        ins();
//        ans += strlen(s+1);
    }

    dfs(0);
//    lansn();
    double ans2 = 1.0*ans/n/(n-1);
    printf("%.10f\n",ans2);
    return 0;
}