제출 #438004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438004		dutch	Type Printer (IOI08_printer)	C++17	100 / 100	113 ms	48404 KiB

printer

#include <bits/stdc++.h>
using namespace std;

const int LIM = 20 * 25000;

array<int, 26> g[LIM];
int a[LIM], b[LIM], w = 0, j = 0;
pair<int, string> mx = {0, ""};

void dfs(int u){
	while(a[u]--) cout << "P\n";
	if(u == w) exit(0);
	for(int i=0; i<26; ++i){
		if(!g[u][i] || g[u][i] == b[u]) continue;
		cout << char('a' + i) << '\n';
		dfs(g[u][i]);
		cout << "-\n";
	}
	if(!b[u]) return;
	cout << mx.second[j++] << '\n';
	dfs(b[u]);
	cout << "-\n";
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, e = 0; cin >> n;
	for(int i=0; i<n; ++i){
		string s; cin >> s;
		mx = max(mx, {s.size(), s});
		int u = 0;
		for(char c : s){
			if(!g[u][c-'a']) g[u][c-'a'] = ++e;
			u = g[u][c-'a'];
		}
		++a[u];
	}
	for(char c : mx.second)
		b[w] = g[w][c-'a'], w = b[w];
	cout << 2*e - mx.first + n << '\n';
	dfs(0);
}

• 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