| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 850053 | dshfjka | Type Printer (IOI08_printer) | C++14 | 1034 ms | 57272 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
struct Trie{
	int masuk=0;
	struct node{
		int cnt;
		int child[26];
	};
	vector<node>t;
	Trie(){
		t.emplace_back();
	}
	void insert(int depth ,int pos, string s)
	{
		if(depth==s.length())
		{
			t[pos].cnt++;
			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<t[pos].cnt;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()
{
	int n;
	scanf("%d",&n);
	Trie trie;
	for(int a=1;a<=n;a++)
	{
		string x;
		cin>>x;
		trie.insert(0,0,x);
	}
	trie.query(0,1);
	printf("%d\n",v.size());
	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... | ||||
