Submission #1062376

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062376		tamir1	Type Printer (IOI08_printer)	C++17	100 / 100	124 ms	113464 KiB

printer

#include<bits/stdc++.h>
using namespace std;
string s,ans;
int n,mx;
struct mod{
	mod *node[30];
	bool togsgol;
	int x;
	mod(){
		x=0;
		for(int i=0;i<=26;i++){
			node[i]=NULL;
		}
		togsgol=0;
	}
};
int dfs(mod *root){
	int mx=0;
	if(root==NULL) return 0;
	for(int i=0;i<26;i++){
		int y=dfs(root->node[i]);
		if(mx<y){
			mx=y;
			root->x=i;
		}
	}
	return mx+1;
}
void solve(mod *root){
	if(root->togsgol) ans.push_back('P');
	for(int i=0;i<26;i++){
		if(i!=root->x && root->node[i]!=NULL){
			ans.push_back(i+'a');
			solve(root->node[i]);
		}
	}
	if(root->node[root->x]!=NULL){
		ans.push_back(root->x+'a');
		solve(root->node[root->x]);
	}
	ans.push_back('-');
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	mod *root = new mod();
	mod *root1=root;
	for(int i=0;i<n;i++){
		cin >> s;
		int m=s.size();
		root1=root;
		for(int j=0;j<m;j++){
			if(root1->node[s[j]-'a']==NULL){
				root1->node[s[j]-'a']=new mod();
				root1=root1->node[s[j]-'a'];
			}
			else root1=root1->node[s[j]-'a'];
		}
		root1->togsgol=1;
		mx=max(mx,m);
	}
	root1=root;
	dfs(root1);
	solve(root1);
	while(ans.back()=='-') ans.pop_back();
	cout << ans.size() << "\n";
	for(int i=0;i<ans.size();i++) cout << ans[i] << "\n";
}

Compilation message (stderr)

printer.cpp: In function 'int main()':
printer.cpp:67:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for(int i=0;i<ans.size();i++) cout << ans[i] << "\n";
      |              ~^~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10