ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 Tomb Raider（map+二进制枚举）

#1829 : 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>
using namespace std;#define e exp(1)
#define pi acos(-1)
#define mod 998244353
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}int n,flag;
string s;
map<string,int> m,vis;
vector<string> v;
string sub(int x)
{string index=s.substr(x);index+=s.substr(0,x);return index;
}
bool cmp(string a,string b)
{if(a.length()==b.length())return a<b;return a.length()>b.length();
}
int main()
{while(~scanf("%d",&n)){m.clear();v.clear();flag=0;for(int cas=0; cas<n; cas++){cin>>s;int len=s.length();for(int l=0; l<len; l++){string s1=sub(l);for(int i=1; i<(1<<len); i++){string s2;for(int j=0; j<len; j++){if((1<<j)&i)s2+=s1[j];}if(vis[s2]==0){m[s2]++;vis[s2]=1;}}}vis.clear();}for(map<string,int>::iterator i=m.begin(); i!=m.end(); i++){if(i->second==n){v.push_back(i->first);flag=1;}}sort(v.begin(), v.end(), cmp);if(flag==0)puts("0");else cout<<v[0]<<endl;}return 0;
}

ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 Tomb Raider（map+二进制枚举）相关推荐

ACM/ICPC 2018亚洲区预选赛北京赛站网络赛【bfs + 记忆化搜索 + 剪枝】 AC 代码
ACM 北京区域赛 bfs+剪枝+ms 第一个一遍过的题目,基本没有看题解记忆搜索当中,注意初始化成一个特殊值:而在访问之后,每个点就会有一个不同于INF(或者 -1等特殊标记)的值先到先得,适者 ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 80 Days（双向队列+尺取法）
#1831 : 80 Days 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 80 Days is an interesting game based on Jules ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 D【队列】
#1831 : 80 Days 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 80 Days is an interesting game based on Jules ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 D. 80 Days
题解题目大意 n个点组成一个环形初始钱为m 从i走到j需要-b[i] + a[j] 要求按照顺时针走完所有的点(不用再回到起点) 过程中m不能小于0 输出最小的起点编号直接把a[i]和b[i]合 ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛
Saving Tang Monk II Tomb Raider Cheat 80 Days Odd Chess Shortest Path Problem The Mole K-Dimensional ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A Saving Tang Monk II【分层bfs】
时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 <Journey to the West>(also <Monkey>) is one of the ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A. Saving Tang Monk II
题解题目大意给一个图S是起点 T是终点 .是空房间 #是毒气室 B是氧气瓶存放室 P是加速室每次走到空房间或者起点消耗1秒走到氧气室获得一个氧气瓶最多携带5个氧气瓶进入毒气室需要一瓶氧气并且 ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 80 Days ——尺取
描述 80 Days is an interesting game based on Jules Verne's science fiction "Around the World in E ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 C-cheat
超级水的模拟的,我也就会做模拟了--坑有点多,一直没调出来bug,赛后才发现少了一个数字-- 描述 Cheat is a card game played by four players sittin ...

ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 Tomb Raider（map+二进制枚举）

#1829 : Tomb Raider

描述

输入

输出

ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 Tomb Raider（map+二进制枚举）相关推荐

最新文章

热门文章