제출 #1103915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103915		dubabuba	Type Printer (IOI08_printer)	C++14	60 / 100	1066 ms	105696 KiB

printer

#include <bits/stdc++.h>
using namespace std;
 
const int mxc = 26;
 
struct trie {
	trie *chi[mxc];
	int len;
	int cnt;
	int las;
 
	trie() {
		cnt = 0;
		for(int i = 0; i < mxc; i++)
			chi[i] = NULL;
		len = 0;
	}
};
 
void maxer(int &MAX, int CMP) { if(MAX < CMP) MAX = CMP; }
void insert(trie *root, string s) {
	for(char c : s) {
		if(root->chi[c - 'a'] == NULL)
			root->chi[c - 'a'] = new trie();
		maxer(root->len, s.size());
		root = root->chi[c - 'a'];
	}
	root->len = s.size();
	root->cnt++;
}
 
trie *root = new trie();
vector<char> ans;
 
 
void dfs(trie *cur) {
	for(int i = 0; i < mxc; i++) {
		trie *nxt = cur->chi[i];
		if(nxt == NULL) continue;
		dfs(nxt);
		maxer(cur->len, nxt->len);
	}
}
 
void solve(trie *cur) {
	while(cur->cnt) {
		ans.push_back('P');
		cur->cnt--;
	}
 
	for(int i = 0; i < mxc; i++) {
		if(cur->chi[i] == NULL) continue;
		if(cur->chi[i]->len == cur->len) continue;
		ans.push_back('a' + i);
		solve(cur->chi[i]);
		ans.push_back('-');
	}
 
	for(int i = 0; i < mxc; i++) {
		if(cur->chi[i] == NULL) continue;
		if(cur->chi[i]->len != cur->len) continue;
		ans.push_back('a' + i);
		solve(cur->chi[i]);
		ans.push_back('-');
	}
}
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	for(int i = 0; i < n; i++) {
		string s;
		cin >> s;
		insert(root, s);
	}
 
	// dfs(root);
	solve(root);
 
	while(ans.back() != 'P')
		ans.pop_back();
 
	cout << ans.size() << endl;
	for(char c : ans)
		cout << c << endl;
	return 0;
}

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