zoukankan      html  css  js  c++  java
  • ACM-ICPC2018北京网络赛 Tomb Raider(暴力)

    题目2 : Tomb Raider

    时间限制:1000ms
    单点时限:1000ms
    内存限制:256MB

    描述

    Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyond her limits when she discovers the island where her father disappeared. In this mysterious island, Lara finds a tomb with a very heavy door. To open the door, Lara must input the password at the stone keyboard on the door. But what is the password? After reading the research notes written in her father's notebook, Lara finds out that the key is on the statue beside the door.

    The statue is wearing many arm rings on which some letters are carved. So there is a string on each ring. Because the letters are carved on a circle and the spaces between any adjacent letters are all equal, any letter can be the starting letter of the string. The longest common subsequence (let's call it "LCS") of the strings on all rings is the password. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

    For example, there are two strings on two arm rings: s1 = "abcdefg" and s2 = "zaxcdkgb". Then "acdg" is a LCS if you consider 'a' as the starting letter of s1, and consider 'z' or 'a' as the starting letter of s2. But if you consider 'd' as the starting letter of s1 and s2, you can get "dgac" as a LCS. If there are more than one LCS, the password is the one which is the smallest in lexicographical order.

    Please find the password for Lara.

    输入

    There are no more than 10 test cases.

    In each case:

    The first line is an integer n, meaning there are n (0 < n ≤ 10) arm rings.

    Then n lines follow. Each line is a string on an arm ring consisting of only lowercase letters. The length of the string is no more than 8.

    输出

    For each case, print the password. If there is no LCS, print 0 instead.

    样例输入
    2
    abcdefg
    zaxcdkgb
    5
    abcdef
    kedajceu
    adbac
    abcdef
    abcdafc
    2
    abc
    def
    样例输出
    acdg
    acd
    0




    #include<bits/stdc++.h>
    #define MAX 15
    using namespace std;
    typedef long long ll;
    
    string s[MAX];
    int n;
    string ss,ans;
    
    int find(string x){
        int lenx=x.length();
        for(int i=1;i<n;i++){
            int len=s[i].length();
            int f=0;
            for(int k=0;k<len;k++){
                if(s[i][k]==x[0]){
                    int c=0;int l=-1;
                    for(int j=k;j<len;j++){
                        if(s[i][j]==x[c]){
                            if(l==-1) l=j;
                            c++;
                            if(c>=lenx&&(j-l+1)<=(len/2)){
                                f=1;
                                break;
                            }
                        }
                    }
                    if(f==1) break;
                }
            }
            if(f==0) return 0;
        }
        return 1;
    }
    void dfs(int en,string x,int st){
        if(st>=en){
            if(find(x)==1){
                if(x.length()>ans.length()){
                    ans=x;
                }
                else if(x.length()==ans.length()){
                    if(x<ans){
                        ans=x;
                    }
                }
            }
            return;
        }
        for(int i=0;i<=1;i++){
            if(i==1) dfs(en,x+ss[st],st+1);
            else dfs(en,x,st+1);
        }
    }
    int main()
    {
        int t,i,j;
        while(~scanf("%d",&n)){
            for(i=0;i<n;i++){
                cin>>s[i];
                s[i]+=s[i];
            }
            ans="{";
            int len=s[0].length();
            for(i=0;i<len;i++){
                int minn=min(len-i,len/2);
                for(j=1;j<=minn;j++){
                    ss=s[0].substr(i,j);
                    dfs(j,"",0);
                }
            }
            if(ans=="{") printf("0
    ");
            else cout<<ans<<endl;
        }
        return 0;
    }
  • 相关阅读:
    关于git的简单使用
    手机设备上调试接口,查看错误信息
    用after伪类清除浮动
    js字母大小写转换方法
    使用淘宝 NPM 镜像
    JS判断类型
    JS判断客户端是手机还是PC的2个代码
    微信小程序 WebSocket
    服务器安全管理
    Linux下禁止ping最简单的方法
  • 原文地址:https://www.cnblogs.com/yzm10/p/9690877.html
Copyright © 2011-2022 走看看