제출 #396179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396179		Berted	Type Printer (IOI08_printer)	C++14	100 / 100	148 ms	51684 KiB

printer

#include <iostream>

using namespace std;

const int INF = 1e8;

int N; string ans;
int adj[500001][26], cnt[500001], DP[500001], sz = 0;

inline int newNode()
{
	for (int i = 0; i < 26; i++) adj[sz][i] = -1;
	return sz++;
}

inline void insert(int u, int i, const string& s)
{
	if (i < s.size())
	{
		int &v = adj[u][s[i] - 'a'];
		if (v == -1) {v = newNode();}
		insert(v, i + 1, s); DP[u] = max(DP[u], DP[v] + 1);
	}
	else {cnt[u]++;}
}

inline void solve(int u, bool m)
{
	int hvy = -1;
	for (int i = 0; i < cnt[u]; i++) ans.push_back('P');
	for (int i = 0; i < 26; i++)
	{
		if (adj[u][i] != -1 && m && (hvy == -1 || DP[adj[u][i]] > DP[adj[u][hvy]])) hvy = i;
	}
	for (int i = 0; i < 26; i++)
	{
		if (adj[u][i] != -1 && hvy != i) 
		{
			ans.push_back(i + 'a');
			solve(adj[u][i], 0);
			ans.push_back('-');
		}
	}
	if (hvy != -1) {ans.push_back(hvy + 'a'); solve(adj[u][hvy], 1);}
}

int main()
{
	ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N;
	newNode();
	for (int i = 0; i < N; i++) {string S; cin >> S; insert(0, 0, S);}
	solve(0, 1);
	cout << ans.size() << "\n";
	for (const char &c : ans) cout << c << "\n";
	return 0;
}

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

printer.cpp: In function 'void insert(int, int, const string&)':
printer.cpp:18:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  if (i < s.size())
      |      ~~^~~~~~~~~~

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