# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
444015 | cpp219 | Type Printer (IOI08_printer) | C++14 | 202 ms | 99560 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e5 + 9;
const ll Log2 = 20;
const ll inf = 1e9 + 7;
deque<char> ans;
string s;
ll n;
struct Trie{
Trie *child[26]; ll End,mx;
Trie (){
for (ll i = 0;i < 26;i++) child[i] = NULL;
End = 0; mx = 0;
}
void Add(ll pos,string &s){
if (pos == s.size()){
End++; mx = 1; return;
}
ll now = s[pos] - 'a';
if (!child[now]) child[now] = new Trie;
child[now] -> Add(pos + 1,s);
mx = max(mx,child[now] -> mx + 1);
}
void DFS(){
while(End--) ans.push_back('P');
ll cur = 0,chosen = 0;
for (ll i = 0;i < 26;i++) if (child[i] && cur < child[i] -> mx)
cur = child[i] -> mx, chosen = i;
for (ll i = 0;i < 26;i++){
if (child[i] && i != chosen) ans.push_back(i + 'a'),child[i] -> DFS();
}
if (child[chosen]) ans.push_back(chosen + 'a'),child[chosen] -> DFS();
ans.push_back('-');
}
};
Trie Tree;
int main(){
ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define task "tst"
if (fopen(task".INP","r")){
freopen(task".INP","r",stdin);
//freopen(task".OUT","w",stdout);
}
cin>>n;
for (ll i = 1;i <= n;i++){
cin>>s; Tree.Add(0,s);
}
Tree.DFS();
while(ans.back() == '-') ans.pop_back();
cout<<ans.size()<<"\n";
for (auto i : ans) cout<<i<<"\n";
}
컴파일 시 표준 에러 (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... |