CodeForces - 633C(사전 트리 + dfs 소급)

C. Spy Syndrome 2
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can't use a cipher as basic and ancient as Caesar cipher. After many weeks of observation of Siddhant’s sentences, Yash determined a new cipher technique.
For a given sentence, the cipher is processed as:
Convert all letters of the sentence to lowercase.
Reverse each of the words of the sentence individually.
Remove all the spaces in the sentence.
For example, when this cipher is applied to the sentence
Kira is childish and he hates losing
the resulting string is
ariksihsidlihcdnaehsetahgnisol
Now Yash is given some ciphered string and a list of words. Help him to find out any original sentence composed using only words from the list. Note, that any of the given words could be used in the sentence multiple times.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 10 000) — the length of the ciphered text. The second line consists of nlowercase English letters — the ciphered text t.
The third line contains a single integer m (1 ≤ m ≤ 100 000) — the number of words which will be considered while deciphering the text. Each of the next m lines contains a non-empty word wi (|wi| ≤ 1 000) consisting of uppercase and lowercase English letters only. It's guaranteed that the total length of all words doesn't exceed 1 000 000.
Output
Print one line — the original sentence. It is guaranteed that at least one solution exists. If there are multiple solutions, you may output any of those.
Examples
input
Copy

30
ariksihsidlihcdnaehsetahgnisol
10
Kira
hates
is
he
losing
death
childish
L
and
Note

output

Kira is childish and he hates losing

input
Copy

12
iherehtolleh
5
HI
Ho
there
HeLLo
hello

output

HI there HeLLo

Note
In sample case 2 there may be multiple accepted outputs, "HI there HeLLo"and "HI there hello"you may output any of them.

#include
#include
#include
#include
#include
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
int n, m;
char s[maxn], word[maxn][1005];
int trie[1000005][27], tot=0, mark[1000005], ans[maxn], cnt=0;//          ，        ，wa    ，      1e6*27   

void insert(int len, int id){//     
	
	int now=0;
	for(int i=len-1; i>=0; i--)
	{
		int to;
		if(word[id][i]>'Z') to=word[id][i]-'a';
		else to=word[id][i]-'A';
		
		if(!trie[now][to])
			trie[now][to]=++tot;
			
		now=trie[now][to];
	}
	mark[now]=id;
}

bool solve(int pos){
	if(pos==n)
	{
		for(int i=0; i

이 내용에 흥미가 있습니까?

현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:

UVa: 1401 Remember the Word(사전 트리)

사전 트리, 처음 씁니다.아직 미루어야 한다. dp[i]=sum｛dp[i+len(x)]｝x는str[i...L]의 접두사 길이입니다. 소박한 생각은 모든 x를 매거한 다음에str[i...L]의 접두사인지 판단하는 것이...

텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.

CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.

CodeForces - 633C(사전 트리 + dfs 소급)

좋은 웹페이지 즐겨찾기