zoukankan      html  css  js  c++  java
  • Codeforces Round #410 (Div. 2) B. Mike and strings

    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
    给你n个字符串,让你找怎么处理使你移动的个数最小,如果移动后还不相等就输出-1
    #include <bits/stdc++.h>
    using namespace std;
    int main(){
    int n=0;
    cin>>n;
    string s[55];
    for(int i=0;i<n;i++)
    cin>>s[i];
    int mi=1<<30;
    int l=s[0].length();
    for(int i=0;i<n;i++){
    int t=0;
    for(int j=0;j<n;j++){
    if(j!=i){
    int k;
    for(k=0;s[j][k];k++)
    if(s[j].substr(k)+s[j].substr(0,k)==s[i]){
        t+=k;
        break;
    }
    if(k>=l){cout<<"-1"<<endl;return 0;}}}
    mi=min(t,mi);}
    cout<<mi<<endl;
    return 0;
    }
    View Code
  • 相关阅读:
    关闭游标
    OCP-1Z0-053-200题-19题-601
    OCP-1Z0-053-200题-17题-99
    OCP-1Z0-053-200题-18题-100
    OCP-1Z0-053-V13.02-99题
    OCP-1Z0-053-200题-16题-98
    OCP-1Z0-053-200题-15题-15
    OCP-1Z0-053-200题-14题-675
    OCP-1Z0-053-200题-13题-97
    OCP-1Z0-053-200题-12题-96
  • 原文地址:https://www.cnblogs.com/BobHuang/p/6822752.html
Copyright © 2011-2022 走看看