#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>
#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9
// more abusive notation (use at your own risk):
// #define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */
// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7
void setIO(const string& str) {// fast input/output
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (str.empty()) return;
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
int N;
vc<char> ops;
vi adj[500005];
int dp[500005];
char c[500005];
bitset<500005> b(0);
int cur = 1, prints = 0;
void construct() {
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
int v = 0;
for (int j = 0; j < sz(s); ++j) {
bool found = false;
fch(u, adj[v]) {
if (c[u] == s[j]) {
v = u;
found = true;
break;
}
}
if (!found) {
adj[v].PB(cur);
c[cur] = s[j];
v = cur++;
}
}
b[v].flip();
}
}
void dfs1(int v) {
fch(u, adj[v]) {
dfs1(u);
ckmax(dp[v], dp[u] + 1);
}
}
void dfs(int v) {
if (b[v]) {
ops.PB('P');
prints++;
if (prints == N) {
return;
}
}
fch(u, adj[v]) {
ops.PB(c[u]);
dfs(u);
if (prints == N) {
return;
}
}
if (v != 0) {
ops.PB('-'); // minimize this part, have to go to the smaller subtrees first (greedy algorithm)
}
}
signed main() { // TIME YOURSELF !!!
setIO("");
cin >> N;
c[0] = '\0';
construct();
dfs1(0);
for (int i = 0; i < cur; ++i) {
sort(all(adj[i]), [&](const int& a, const int& b) {
return dp[a] < dp[b];
});
}
dfs(0);
cout << sz(ops) << '\n';
for (int i = 0; i < sz(ops); ++i) {
cout << ops[i] << '\n';
}
}
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler
Compilation message
printer.cpp: In function 'void setIO(const string&)':
printer.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
12376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
12380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
12492 KB |
Output is correct |
| 2 |
Correct |
2 ms |
12380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
12380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
12380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
12376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
12380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
12380 KB |
Output is correct |
| 2 |
Correct |
3 ms |
12636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
12636 KB |
Output is correct |
| 2 |
Correct |
5 ms |
12892 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
13404 KB |
Output is correct |
| 2 |
Correct |
11 ms |
14684 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
15064 KB |
Output is correct |
| 2 |
Correct |
6 ms |
13148 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
20444 KB |
Output is correct |
| 2 |
Correct |
54 ms |
28224 KB |
Output is correct |
| 3 |
Correct |
31 ms |
21720 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
18896 KB |
Output is correct |
| 2 |
Correct |
65 ms |
30916 KB |
Output is correct |
| 3 |
Correct |
33 ms |
22472 KB |
Output is correct |
| 4 |
Correct |
57 ms |
29988 KB |
Output is correct |
