oj.uz

답안 #550895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550895 2022-04-19T11:19:11 Z Jomnoi Type Printer (IOI08_printer) C++17
20 / 100
 44 ms 35532 KB 
#include <bits/stdc++.h>
#define DEBUG false
using namespace std;

vector <char> ans;

class Node {
public :
	Node *c[26];
	int sz;
	bool finish;
	Node() : finish(false), sz(1) {
		for(int i = 0; i < 26; i++) {
			c[i] = NULL;
		}
	}
};

void add(Node *node, string s, int idx = 0) {
	if(idx == s.length()) {
		node->finish = true;
		return;
	}

	int v = s[idx] - 'a';
	if(node->c[v] == NULL) {
		node->c[v] = new Node();
	}

	add(node->c[v], s, idx + 1);

	node->sz = 1;
	for(int i = 0; i < 26; i++) {
		if(node->c[i] != NULL) {
			node->sz += node->c[i]->sz;
		}
	}
}

void solve(Node *node) {
	if(node->finish == true) {
		ans.push_back('P');
		return;
	}

	vector <pair <int, int>> vec;
	for(int v = 0; v < 26; v++) {
		if(node->c[v] != NULL) {
			vec.emplace_back(node->c[v]->sz, v);
		}
	}

	sort(vec.begin(), vec.end());

	for(auto [l, v] : vec) {
		ans.push_back(v + 'a');
		solve(node->c[v]);
		ans.push_back('-');
	}
}

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int N;
	cin >> N;
	Node *root = new Node();
	for(int i = 1; i <= N; i++) {
		string s;
		cin >> s;
		add(root, s);
	}

	solve(root);

	while(ans.back() == '-') {
		ans.pop_back();
	}

	cout << ans.size() << '\n';
	for(auto c : ans) {
		cout << c << '\n';
	}
	return 0;
}

Compilation message

printer.cpp: In constructor 'Node::Node()':
printer.cpp:11:7: warning: 'Node::finish' will be initialized after [-Wreorder]
   11 |  bool finish;
      |       ^~~~~~
printer.cpp:10:6: warning:   'int Node::sz' [-Wreorder]
   10 |  int sz;
      |      ^~
printer.cpp:12:2: warning:   when initialized here [-Wreorder]
   12 |  Node() : finish(false), sz(1) {
      |  ^~~~
printer.cpp: In function 'void add(Node*, std::string, int)':
printer.cpp:20:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  if(idx == s.length()) {
      |     ~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 212 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 324 KB didn't print every word
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1748 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 5716 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 14172 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 35532 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 27724 KB didn't print every word
2 Halted 0 ms 0 KB -