# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004420 | NoLove | Type Printer (IOI08_printer) | C++14 | 45 ms | 38788 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author : Lăng Trọng Đạt
* created: 21-06-2024
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int long long
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;
using vi = vector<int>;
#define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
void mx(int& a, int b) { if (b > a) a = b; }
void mi(int& a, int b) { if (b < a) a = b; }
#define si(x) (int)(x.size())
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 5;
int g[MAXN];
int nxt[MAXN][28], d[MAXN], max_d[MAXN];
int n, sz = 0;
void insert(string& s) {
int v = 0;
for (char c : s) {
if (!nxt[v][c - 'a']) nxt[v][c - 'a'] = ++sz;
d[nxt[v][c - 'a']] = d[v] + 1;
v = nxt[v][c - 'a'];
}
max_d[v] = d[v];
}
void dfs(int v) {
int hi = -1;
FOR(i, 0, 25) {
if (nxt[v][i] && (hi == -1 or max_d[nxt[v][i]] > max_d[hi])) hi = i;
}
FOR(i, 0, 25) {
if (nxt[v][i] && i != hi) {
cout << (char)(i + 'a') << "\n";
dfs(nxt[v][i]);
if (n)
cout << "-\n";
}
}
if (hi == -1) cout << "P\n", n--;
else {
cout << (char)(hi + 'a') << "\n";
dfs(nxt[v][hi]);
if (n)
cout << "-\n";
}
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("hi.inp", "r")) {
freopen("hi.inp", "r", stdin);
// freopen("hi.out", "w", stdout);
}
string s;
cin >> n;
FOR(i, 1, n) {
cin >> s;
insert(s);
}
for (int i = sz; i >= 0; i--) {
FOR(c, 0, 25)
if (nxt[i][c]) mx(max_d[i], max_d[nxt[i][c]]);
}
dfs(0);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |