/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 998244353;// 1000000007
const ld pi = 3.1415926535;
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "test1")
freopen((s + ".out").c_str(), "w", stdout);
}
}
/*
#ifndef arwaeystoamneg
#include ".h"
#endif*/
#ifdef arwaeystoamneg
#endif
int n;
vector<string>a;
const int MAX = 1e5 + 5, SZ = 26;
struct node
{
char t;
int adj[SZ];
bool end;
node(char x)
{
t = x;
F0R(i, SZ)adj[i] = -1;
end = 0;
}
};
node* x[MAX * SZ];
int cur = 1;
void insert(string& t, int i, int p)
{
if (p == sz(t))
{
x[i]->end = 1;
return;
}
int j = x[i]->adj[t[p] - 'a'];
if (j == -1)
{
j = cur;
x[i]->adj[t[p] - 'a'] = cur++;
x[j] = new node(t[p]);
}
insert(t, j, p + 1);
}
vector<vi>adj;
vi b, c;
vector<char>ans;
vi depth;
void init(int i, int p)
{
depth[i] = 0;
trav(x, adj[i])
{
if (x == p)continue;
init(x, i);
depth[i] = max(depth[i], depth[x] + 1);
}
}
void dfs(int i, int p)
{
if (b[i])ans.pb('P');
trav(x, adj[i])
{
if (x == p)continue;
ans.pb(c[x]);
dfs(x, i);
}
ans.pb('-');
}
int main()
{
setIO("");
cin >> n;
a.rsz(n);
trav(x, a)cin >> x;
//sort(all(a), [](string x, string y) {return sz(x) < sz(y); });
x[0] = new node('$');
trav(x, a)insert(x, 0, 0);
adj.rsz(cur);
b.rsz(cur);
c.rsz(cur);
F0R(i, cur)F0R(j, SZ)if (x[i]->adj[j] != -1)adj[i].pb(x[i]->adj[j]);
F0R(i, cur)c[i] = x[i]->t;
F0R(i, cur)b[i] = x[i]->end;
depth.rsz(cur);
init(0, -1);
F0R(i, cur)sort(all(adj[i]), [](int i, int j) {return depth[i] < depth[j]; });
dfs(0, -1);
while (ans.back() == '-')ans.pop_back();
cout << sz(ans) << endl;
trav(x, ans)cout << x << endl;
}
Compilation message
printer.cpp: In function 'void setIO(std::string)':
printer.cpp:53:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
53 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp:55:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
55 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Correct |
3 ms |
1132 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1772 KB |
Output is correct |
| 2 |
Correct |
7 ms |
2156 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
5760 KB |
Output is correct |
| 2 |
Correct |
26 ms |
11628 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
54 ms |
13672 KB |
Output is correct |
| 2 |
Correct |
11 ms |
3692 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
93 ms |
34020 KB |
Output is correct |
| 2 |
Correct |
182 ms |
77664 KB |
Output is correct |
| 3 |
Correct |
98 ms |
40804 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
68 ms |
26468 KB |
Output is correct |
| 2 |
Correct |
219 ms |
92516 KB |
Output is correct |
| 3 |
Correct |
108 ms |
46180 KB |
Output is correct |
| 4 |
Correct |
185 ms |
87264 KB |
Output is correct |
