#include<bits/stdc++.h>
using namespace std;
const int lmt=1e6;
int adj[lmt][26];
bool vis[lmt];
int subtree[lmt];
int indx=1;
int cnt=0;
string ans;
void insert(string s,int now)
{
for(char c:s)
{
int num=c-'a';
if(adj[now][num]==0)
{
indx++;
adj[now][num]=indx;
now=indx;
}
else
{
now=adj[now][num];
}
}
vis[now]=1;
}
void getsubtree(int u)
{
subtree[u]=1;
for(int i=0;i<26;i++)
{
if(adj[u][i]!=0)
{
int v=adj[u][i];
getsubtree(v);
subtree[u]+=subtree[v];
}
}
}
void dfs(int u)
{
vector<pair<int,int>>p;
for(int i=0;i<26;i++)
{
if(adj[u][i]!=0)
{
p.push_back(make_pair(subtree[adj[u][i]],i));
}
}
sort(p.begin(),p.end());
for(int i=0;i<p.size();i++)
{
char c='a'+p[i].second;
ans+=c;
dfs(adj[u][p[i].second]);
}
if(vis[u])
{
vis[u]=0;
ans+='P';
}
ans+='-';
}
int main()
{
//#ifndef ONLINE_JUDGE
// freopen("take.in","r",stdin);
// freopen("give.out","w",stdout);
//#endif
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
string s;
cin>>s;
insert(s,1);
}
getsubtree(1);
dfs(1);
reverse(ans.begin(),ans.end());
while(ans[0]=='-') ans.erase(ans.begin());
reverse(ans.begin(),ans.end());
cout<<ans.size()<<endl;
for(char c:ans) cout<<c<<endl;
}
Compilation message
printer.cpp: In function 'void dfs(int)':
printer.cpp:52:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<p.size();i++)
~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
1152 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
117 ms |
3200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
289 ms |
7664 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
692 ms |
18836 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
583 ms |
14616 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |