# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
818179 | Sir_Ahmed_Imran | Type Printer (IOI08_printer) | C++17 | 159 ms | 84476 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define li long int
#define ld long double
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0)
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define terminator main
#define MAXN 100001
class TrieNode {
public:
bool prt;
TrieNode* nxt[26];
TrieNode(){
for(int i=prt=0;i<26;i++)
nxt[i]=NULL;
}
};
class Trie{
public:
TrieNode* root;
Trie(){
root=new TrieNode();
}
void insert(string a){
int m;
TrieNode* x=root;
for(int i=0;i<a.size();i++){
m=a[i]-'a';
if(!x->nxt[m])
x->nxt[m]=new TrieNode();
x=x->nxt[m];
}
x->prt=1;
}
vector<char> dfs(TrieNode* x,vector<char> v){
vector<pair<int,vector<char>>> a;
for(int i=0;i<26;i++){
if(!x->nxt[i]) continue;
vector<char> u;
u.append('a'+i);
if((x->nxt[i])->prt)
u.append('P');
u=dfs(x->nxt[i],u);
u.append('-');
a.append({u.size(),u});
}
sort(all(a));
for(auto& i:a)
for(auto& j:i.ss)
v.append(j);
return v;
}
};
void solve(){
string a;
int n,m,o,p,q;
Trie x;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
x.insert(a);
}
vector<char> v;
v=x.dfs(x.root,v);
m=v.size();
while(m && v[m-1]=='-')
m--;
cout<<m<<nl;
for(int i=0;i<m;i++)
cout<<v[i]<<nl;
}
int terminator(){
L0TA;
solve();
return 0;
}
컴파일 시 표준 에러 (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... |