# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850054 | dshfjka | Type Printer (IOI08_printer) | C++14 | 998 ms | 57788 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.
#include <bits/stdc++.h>
#define LL long long
using namespace std;
vector<char>v;
int dp[500001];
// kata terpanjang dimaksukin nanti aja bos
int cnt[500001];
struct Trie{
int masuk=0;
struct node{
int child[26];
};
vector<node>t;
Trie(){
t.emplace_back();
}
void insert(int depth ,int pos,const string& s)
{
if(depth==s.length())
{
cnt[pos]++;
return;
}
if(!t[pos].child[s[depth]-'a']){
t[pos].child[s[depth]-'a']=t.size();
t.emplace_back();
}
insert(depth+1,t[pos].child[s[depth]-'a'],s);
dp[pos]=max(dp[pos],dp[t[pos].child[s[depth]-'a']]+1);
// t[pos].cnt++;
}
void query( int pos, bool status)
{
// if(++masuk ==60)exit(0);
// cout<<"pos :"<<pos<<" status :"<<status<<endl;
bool masuk=0;
int maks=-1,ket=-1;
for(int i=0;i<cnt[pos];i++)v.push_back('P');
if(status==1)
{
for(int a=0;a<26;a++)
{
if(t[pos].child[a])
{
if(dp[t[pos].child[a]]>maks)
{
maks=dp[t[pos].child[a]];
ket=a;
}
}
}
}
// printf("maks=%d dan ket=%c\n",maks,ket+'a');
for(int a=0;a<26;a++)
{
if(t[pos].child[a] && ket!=a)
{
masuk=1;
// printf("MASUK dengan %c \n",a+'a');
masuk=1;
v.push_back(a+'a');
query(t[pos].child[a],0);
v.push_back('-');
}
}
if(status && ket!=-1)
{
masuk=1;
v.push_back(ket+'a');
query(t[pos].child[ket],1);
}
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
Trie trie;
for(int a=1;a<=n;a++)
{
string x;
cin>>x;
trie.insert(0,0,x);
}
trie.query(0,1);
cout<<v.size()<<endl;
for(char a:v)cout<<a<<endl;
}
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... |