oj.uz

Submission #1032543

# Submission time Handle Problem Language Result Execution time Memory
1032543 2024-07-24T01:43:09 Z TruongVu Type Printer (IOI08_printer) C++14
10 / 100
 346 ms 36944 KB 
#include<bits/stdc++.h>
using namespace std;
vector<char> res;
struct Trie{
	struct Node{
		Node* child[26];
		int cnt, exist;
		
		Node(){
			for(int i = 0; i < 26; i++) child[i] = NULL;
			exist = cnt = 0;
		}
	};
	int cur;
	Node* root;
	
	Trie() : cur(0){
		root = new Node();
	}
	void add_string(string s){
		Node* p = root;
        for (auto f : s) {
            int c = f - 'a';
            if (p->child[c] == NULL) p->child[c] = new Node();

            p = p->child[c];
            p->cnt++;
        }
        p->exist++;
	}
	void Trie_Recursive(Node* p){
		vector<pair<Node*, int>> tmp;
		for(int i = 0; i < 26; i++){
			if(p->child[i] != NULL){
				tmp.push_back({p->child[i], i});
			}
		}
		sort(tmp.begin(), tmp.end(), [](pair<Node*, int> x, pair<Node*, int> y){
			if(x.first->cnt < y.first->cnt) return true;
			return false;
		});
		for(auto it : tmp){
			res.push_back(char(it.second + 'a'));
			Trie_Recursive(it.first);
			res.push_back('-');
		}
		while(p->exist > 0){
			res.push_back('P');
			p->exist--;
		} 
	}
};
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n; cin >> n;
	Trie T;
	for(int i = 0; i < n; i++){
		string s; cin >> s;
		T.add_string(s);
	}
	T.Trie_Recursive(T.root);
	int cnt = 0;
	vector<char> ans;
	for(auto x : res){
		if(cnt == n) break;
		ans.push_back(x);
		if(x == 'P') cnt++;
	}
	cout << ans.size() << endl;
	for(auto x : ans) cout << x << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 6364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 14932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 36944 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 256 ms 28896 KB Output isn't correct
2 Halted 0 ms 0 KB -