#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) lli(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <ii,lli> iii;
typedef vector <lli> vi;
typedef tree<lli,null_type,less<lli>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
vi al[25000*26];
int dp[25000*26],dp1[25000*26],id[25000*26],n,c=1,co[25000*6];
string s;
void ad(int node,int cur)
{
if(cur==s.size())
{
co[node]++;
return;
}
for(int i=0;i<al[node].size();++i)
{
if(id[al[node][i]]==s[cur]-'a')
return ad(al[node][i],cur+1);
}
al[node].pb(c);
id[c]=s[cur]-'a';
c++;
return ad(c-1,cur+1);
}
void dfs(int node)
{
for(int i=0;i<al[node].size();++i)
dfs(al[node][i]);
int m=0;
dp[node]=2+co[node];
dp1[node]=1+co[node];
for(int i=0;i<al[node].size();++i)
{
dp[node]+=dp[al[node][i]];
dp1[node]+=dp[al[node][i]];
m=min(m,-dp[al[node][i]]+dp1[al[node][i]]);
}
dp1[node]+=m;
}
int x=0;
void dfs1(int node,int t)
{
if(node!=0)
{
x++;
if(x>dp1[0]-1)
exit(2);
cout<<char(id[node]+'a')<<endl;
}
ii m=mp(100,-1);
if(t==1)
{
for(int i=0;i<al[node].size();++i)
m=min(m,mp(0ll-dp[al[node][i]]+dp1[al[node][i]],i*1LL));
}
for(int i=0;i<al[node].size();++i)
{
if(i!=m.S)
dfs1(al[node][i],0);
}
if(m.S!=-1)
dfs1(al[node][m.S],1);
while(co[node])
{
x++;
if(x>dp1[0]-1)
exit(3);
cout<<'P'<<endl;
co[node]--;
}
if(t==0)
{
x++;
if(x>dp1[0]-1)
exit(4);
cout<<'-'<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;++i)
{
cin>>s;
ad(0,0);
}
dfs(0);
cout<<dp1[0]-1<<endl;
dfs1(0,1);
return 0;
}
Compilation message
printer.cpp: In function 'void ad(int, int)':
printer.cpp:24:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
24 | if(cur==s.size())
| ~~~^~~~~~~~~~
printer.cpp:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | for(int i=0;i<al[node].size();++i)
| ~^~~~~~~~~~~~~~~~
printer.cpp: In function 'void dfs(int)':
printer.cpp:41:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for(int i=0;i<al[node].size();++i)
| ~^~~~~~~~~~~~~~~~
printer.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i=0;i<al[node].size();++i)
| ~^~~~~~~~~~~~~~~~
printer.cpp: In function 'void dfs1(int, int)':
printer.cpp:67:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for(int i=0;i<al[node].size();++i)
| ~^~~~~~~~~~~~~~~~
printer.cpp:70:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
70 | for(int i=0;i<al[node].size();++i)
| ~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
15596 KB |
Output is correct |
| 2 |
Correct |
10 ms |
15596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
15596 KB |
Output is correct |
| 2 |
Correct |
11 ms |
15596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
15596 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
15696 KB |
Output is correct |
| 2 |
Incorrect |
13 ms |
15596 KB |
printed invalid word |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
14 ms |
15596 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
42 ms |
15980 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
137 ms |
16876 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
310 ms |
18684 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1061 ms |
23736 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
634 ms |
21484 KB |
printed invalid word |
| 2 |
Halted |
0 ms |
0 KB |
- |
