제출 #797942

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797942		acatmeowmeow	Type Printer (IOI08_printer)	C++11	30 / 100	67 ms	38936 KiB

printer

#include <bits/stdc++.h>

using namespace std;

#define int long long 

struct trie {
	bool mark;
	int height = 1;
	trie *next[26];
	
	void extend(int index) { if (!next[index]) next[index] = new trie(); }

	void add(string&s, int index) {
		if (s.size() - 1 == index) mark = true;
		else {
			char nextChar = s[index + 1];
			extend(nextChar - 'a');
			next[nextChar - 'a']->add(s, index + 1);
		}
	}

	void query(vector<char>&ans) {
		if (mark) ans.push_back('P');
		for (int i = 0; i < 26; i++) {
			if (!next[i]) continue;
			ans.push_back(i + 'a');
			next[i]->query(ans);
			ans.push_back('-');
		}
	}

	void dfs() {
		for (int i = 0; i < 26; i++) {
			if (!next[i]) continue;
			next[i]->dfs();
			height = max(height, next[i]->height + 1);
		}
	}
};

const int N = 25000;
int n;
trie *root[26];

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		if (!root[s[0] - 'a']) root[s[0] - 'a'] = new trie();
		root[s[0] - 'a']->add(s, 0);
	}
	vector<pair<int, int>> arr;
	for (int i = 0; i < 26; i++){
		if (!root[i]) continue;
		root[i]->dfs();
		arr.push_back({root[i]->height, i});
	}
	sort(arr.begin(), arr.end());
	vector<char> ans;
	for (auto&v : arr) {
		int index = v.second;
		ans.push_back(index + 'a');
		root[index]->query(ans);
		ans.push_back('-');
	}
	while (ans.size() && ans.back() == '-') ans.pop_back();
	cout << ans.size() << '\n';
	for (auto&v : ans) cout << v << '\n';
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

printer.cpp: In member function 'void trie::add(std::string&, long long int)':
printer.cpp:15:20: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   15 |   if (s.size() - 1 == index) mark = true;
      |       ~~~~~~~~~~~~~^~~~~~~~

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