CUGBACM_Summer_Tranning5

#include<cstring>
#include<string>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<ctime>
#include<cstdlib>
#include<functional>
#include<cmath>
using namespace std;
#define PI acos(-1.0)
#define MAXN 50100
#define eps 1e-7
#define INF 0x7FFFFFFF
#define seed 131
#define mod 1000000007
#define ll long long
#define ull unsigned ll
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

struct node{
    int u,next;
}edge[50100];
int head[20100],sum[20100];
int n,ans,cnt;
void add_edge(int a,int b){
    edge[cnt].u = b;
    edge[cnt].next = head[a];
    head[a] = cnt++;
}
void dfs(int pre,int rt){
    sum[rt] = 1;
    int tot = 0;
    int tot2 = 0;
    int i,j;
    for(i=head[rt];i!=-1;i=edge[i].next){
        int u = edge[i].u;
        if(u==pre)  continue;
        dfs(rt,u);
        sum[rt] += sum[u];
    }
    tot = (sum[rt]-1) * (n-sum[rt]);
    for(i=head[rt];i!=-1;i=edge[i].next){
        int u = edge[i].u;
        if(u==pre)  continue;
        tot2 += sum[u] * (sum[rt]-sum[u]-1);
    }
    tot += tot2 / 2;
    if(tot>ans) ans = tot;
}
int main(){
    int t,i,j,a,b,k=1;
    scanf("%d",&t);
    while(t--){
        memset(head,-1,sizeof(head));
        ans = 0;
        cnt = 0;
        scanf("%d",&n);
        for(i=1;i<n;i++){
            scanf("%d%d",&a,&b);
            add_edge(a,b);
            add_edge(b,a);
        }
        dfs(1,1);
        printf("Case #%d: %d\n",k++,ans);
    }
    return 0;
}

#include<cstring>
#include<string>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<ctime>
#include<cstdlib>
#include<functional>
#include<cmath>
using namespace std;
#define PI acos(-1.0)
#define MAXN 200100
#define eps 1e-7
#define INF 0x7FFFFFFF
#define seed 131
#define mod 1000000007
#define ll long long
#define ull unsigned ll
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

struct node{
    int u,v,dis;
}edge[MAXN];
int father[210],flag[210],num[210];
int aa[210];
int n,m,cnt,ans,k;
bool cmp(node x,node y){
    return x.dis<y.dis;
}
int find(int x){
    int t = x;
    while(t!=father[t])
        t = father[t];
    int k = t;
    while(k!=t){
        int temp = father[k];
        father[k] = t;
        k = temp;
    }
    return t;
}
void gao(){
    int i,j;
    for(i=0;i<m;i++){
        if(cnt>=n-k)  break;
        int a = find(edge[i].u);
        int b = find(edge[i].v);
        if(a!=b){
            father[a] = b;
            ans += edge[i].dis;
            cnt++;
        }
    }
}
int main(){
    int i,j,t,cas = 1,bb;
    scanf("%d",&t);
    while(t--){
        ans = 0;
        memset(flag,0,sizeof(flag));
        scanf("%d%d%d",&n,&m,&k);
        cnt = 0;
        for(i=1;i<=n;i++){
            father[i] = i;
        }
        for(i=0;i<k;i++){
            scanf("%d",&aa[i]);
            for(j=0;j<i;j++){
                int ta = find(aa[i]);
                int tb = find(aa[j]);
                if(ta!=tb){
                    father[ta] = tb;
                }
            }
        }
        for(i=0;i<m;i++){
            scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].dis);
        }
        sort(edge,edge+m,cmp);
        gao();
        printf("Case #%d: %d\n",cas++,ans);
    }
    return 0;
}


/*
999
6 5 2
3 6
1 6 2
1 2 1
2 3 4
3 4 6
4 5 3

12
*/

#include<cstring>
#include<string>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<ctime>
#include<cstdlib>
#include<functional>
#include<cmath>
using namespace std;
#define PI acos(-1.0)
#define MAXN 200100
#define eps 1e-7
#define INF 0x7FFFFFFF
#define seed 131
#define mod 1000000007
#define ll long long
#define ull unsigned ll
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

char str[50010];
ull base[50010],Hash[50010];
int main(){
    int t,i,j,k=1;
    scanf("%d",&t);
    base[0] = 1;
    for(i=1;i<=50005;i++)   base[i] = base[i-1] * seed;
    while(t--){
        scanf("%s",str);
        int l = strlen(str);
        int l2 = l / 2;
        Hash[l] = 0;
        for(i=l-1;i>=0;i--){
            Hash[i] = Hash[i+1] * seed + str[i] - 'A';
        }
        ull p1, p2;
        int ans = 0;
        int ll1,ll2,rr1,rr2;
        ll1 = 0,ll2 = l-1,rr1 = 1,rr2 = l;
        for(i=0;i<l2;i++){
            p1 = Hash[ll1] - Hash[rr1] * base[rr1-ll1];
            p2 = Hash[ll2] - Hash[rr2] * base[rr2-ll2];
            if(p1==p2){
                ans += 2;
                ll1 = rr1;
                rr2 = ll2;
            }
            rr1++;
            ll2--;
        }
        if(rr1-ll1>1||rr2>ll1)    ans++;
        printf("Case #%d: %d\n",k++,ans);
    }
    return 0;
}