Codeforces Round #476 (Div. 2) [Thanks, Telegram!] E. Short Code CF965E

http://codeforces.com/contest/965/problem/E

首先建一棵trie树
问题转化为把有权的点的深度和尽量缩小
容易想到即把所有点尽量往上放
当一个节点有空位并且有多个子节点的时候
首选把最长的放在这个位置

想了半天怎么dp
想来想去觉得麻烦最后还是STL好用(

#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=  2e5+20;
const int maxm = 2e2+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 tol;
int trie[maxn][26];
multiset<int>st[maxn];
char s[maxn];
void ins()
{
    int n = strlen(s+1);
    int u = 0;
    for(int i=1;i<=n;++i)
    {
        int id = s[i]-'a';
        if(trie[u][id]==-1)trie[u][id] = ++tol;
        u = trie[u][id];
    }
    st[u].insert(n);
}
void dfs(int u,int len)
{
    bool can = (u&&st[u].empty());
//    printf("\n%d\n",u);
    for(int i=0;i<26;++i)
    {
        int v = trie[u][i];
        if(v==-1)continue;
        dfs(v,len+1);
        if(st[u].size()<st[v].size());
            st[u].swap(st[v]);
        for(multiset<int>::iterator it = st[v].begin();it != st[v].end();++it)
        {
            st[u].insert(*it);
        }
        st[v].clear();
    }
    if(can)
    {
        st[u].erase(--st[u].end());
        st[u].insert(len);
    }
}
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);
//        puts(s+1);
        ins();
    }
    dfs(0,0);
    ll ans = 0;
    for(multiset<int>::iterator it = st[0].begin();it !=st[0].end();++it)
    {
        ans += *it;
    }
    lansn();
    return 0;
}