【CodeFores 798B】 Mike and strings(模拟+string)

本文探讨了一个字符串同步问题,即通过移动字符串中的字符位置使多个字符串变得相同。文章介绍了一个高效的算法来解决这一问题,并通过实例展示了如何计算最小移动次数。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >


B. Mike and strings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".

Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?

Input

The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.

This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.

Output

Print the minimal number of moves Mike needs in order to make all the strings equal or print  - 1 if there is no solution.

Examples
input
4
xzzwo
zwoxz
zzwox
xzzwo
output
5
input
2
molzv
lzvmo
output
2
input
3
kc
kc
kc
output
0
input
3
aa
aa
ab
output
-1
Note

In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".

题目大意:给n个字符串,将第i个字符串移动xi位,使得最终所有字符串相等,求最小的移动步数和,若无法相等输出-1

思路:n最大50个,枚举每一个字符串作为基础串,求得每种情况的移动步数和,取最小值。string find大发好,比赛时忘了用这个,结果没怼出来。果然还是不太熟悉

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;

int main()
{
    int n,ans;
    string s,t,p;
    while(~scanf("%d",&n)){
        vector<string>v;
        ans=INF;
        for (int i=0; i<n; i++){
            cin>>s;
            v.push_back(s);
        }
        for (int i=0; i<n; i++){
            int sum=0;
            t=v[i];
            for (int j=0; j<n; j++){
                if (i!=j){
                    p=v[j];
                    p+=p;
                    int k=p.find(t);   //返回下标
                    if (k==-1){
                        sum=-1;
                        break;
                    }
                    sum+=k;
                }
            }
            if (sum != -1) ans=min(ans,sum);
        }
        if (ans==INF) printf("-1\n");
        else printf("%d\n",ans);
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值