#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define gcd __gcd
#define popcount __builtin_popcountll
#define mp make_pair
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
int n=v.size();
for(int i=0; i<n; i++)
cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
vector<T>ans;
for(T t:a)
if(ans.empty() || t!=ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a,ll b){
ll ans=a/b;
if(a%b)ans++;
return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M
ll ans=1;
while(exp){
if(exp%2==1)ans=((ans%M)*(base%M))%M;
base=((base%M)*(base%M))%M;
exp/=2;
}
return ans;
}
string to_base(int n,int new_base){
string s;
int nn=n;
while(nn){
s+=to_string(nn%new_base);
nn/=new_base;
}
reverse(all(s));
return s;
}
ll lcm(ll a,ll b){
ll x= (a/gcd(a,b));
return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1){
if(mx==1e18+1)
mx=n;
vl ans(n);
for(int i=0; i<n;i++)
ans[i]=(mn+rand()%(mx-mn+1));
return ans;
}
string substr(string s,int l,int r){
string ans;
for(int i=l; i<=r; i++)
ans+=s[i];
return ans;
}
void solve();
int main(){
GLHF;
int t=1;
//cin >> t;
while(t--)
solve();
}
string ans;
unordered_map<int,int>is_leaf;
unordered_map<int,unordered_map<char,int>>nxt;
unordered_map<int,int>sz;
int timer=0;
void insert(string& s){
int cur=0;
for(int i=0; i<s.size(); i++){
sz[cur]=max(sz[cur],int(s.size()-i));
if(nxt[cur][s[i]])
cur=nxt[cur][s[i]];
else
cur=nxt[cur][s[i]]=++timer;
}
is_leaf[cur]++;
}
void dfs(int cur){
if(is_leaf[cur])
ans+='P';
vector<char> ord;
for(char c='a'; c<='z'; c++)
if(nxt[cur][c])
ord.push_back(c);
if(!ord.size())
return;
sort(all(ord),[&](char x,char y){
return sz[nxt[cur][x]]<sz[nxt[cur][y]];
});
for(int i=0; i<ord.size(); i++){
ans+=(ord[i]);
dfs(nxt[cur][ord[i]]);
ans+=('-');
}
}
void solve() {
int n;
cin >> n;
for(int i=0; i<n; i++){
string s;
cin >> s;
insert(s);
}
for(auto x:sz)
if(x.first)
x.second++;
dfs(0);
while(!ans.empty() && ans.back()=='-')
ans.pop_back();
cout << ans.size() << "\n";
for(char c:ans)
cout << c << "\n";
}
Compilation message
printer.cpp: In function 'void insert(std::string&)':
printer.cpp:120:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
120 | for(int i=0; i<s.size(); i++){
| ~^~~~~~~~~
printer.cpp: In function 'void dfs(int)':
printer.cpp:143:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
143 | for(int i=0; i<ord.size(); i++){
| ~^~~~~~~~~~~
printer.cpp: In function 'void usaco(std::string)':
printer.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
40 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
printer.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
972 KB |
Output is correct |
| 2 |
Correct |
16 ms |
4784 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
32 ms |
8632 KB |
Output is correct |
| 2 |
Correct |
40 ms |
10848 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
115 ms |
31120 KB |
Output is correct |
| 2 |
Correct |
285 ms |
66908 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
370 ms |
78500 KB |
Output is correct |
| 2 |
Correct |
63 ms |
16156 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
834 ms |
197080 KB |
Output is correct |
| 2 |
Runtime error |
713 ms |
262148 KB |
Execution killed with signal 9 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
743 ms |
153932 KB |
Output is correct |
| 2 |
Runtime error |
680 ms |
262148 KB |
Execution killed with signal 9 |
| 3 |
Halted |
0 ms |
0 KB |
- |
