oj.uz

Submission #1103912

# Submission time Handle Problem Language Result Execution time Memory
1103912 2024-10-22T08:21:09 Z dubabuba Type Printer (IOI08_printer) C++14
80 / 100
 1000 ms 105708 KB 
#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 insert(trie *root, string s) {
	for(char c : s) {
		if(root->chi[c - 'a'] == NULL)
			root->chi[c - 'a'] = new trie();
		root = root->chi[c - 'a'];
	}
	root->len = s.size();
	root->cnt++;
}

trie *root = new trie();
vector<char> ans;

void maxer(int &MAX, int CMP) { if(MAX < CMP) MAX = CMP; }

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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 420 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 396 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 12 ms 1272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1872 KB Output is correct
2 Correct 26 ms 2384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 6472 KB Output is correct
2 Correct 169 ms 13384 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 15776 KB Output is correct
2 Correct 55 ms 3408 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 38968 KB Output is correct
2 Execution timed out 1050 ms 88952 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 30400 KB Output is correct
2 Execution timed out 1075 ms 105708 KB Time limit exceeded
3 Halted 0 ms 0 KB -