제출 #303723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303723		FlashGamezzz	Type Printer (IOI08_printer)	C++17	80 / 100	1100 ms	134564 KiB

printer

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>
#include <queue>

using namespace std;

vector< vector<long> > lets;
vector< vector<int> > has;
vector<bool> endb;
vector<int> length;
vector<char> ans;

void add(long c, int i, string s){
	if (i == s.length()){
		endb[c] = true; length[c] = max(0, length[c]);
		return;
	}
	int l = int(s[i])-97;
	if (lets[c][l] == 0){
		vector<long> t; for (int j = 0; j < 26; j++) t.push_back(0);
		lets.push_back(t); endb.push_back(false); length.push_back(-100);
		has.push_back(vector<int>()); has[c].push_back(l);
		lets[c][l] = lets.size()-1;
	}
	add(lets[c][l], i+1, s);
	length[c] = max(length[lets[c][l]]+1, length[c]);
}

void solve(long c){
	if (endb[c]){
		ans.push_back('P');
	}
	vector< pair<int, int> > ls;
	for (int a : has[c]){
		ls.push_back(make_pair(length[lets[c][a]], a));
	}
	sort(ls.begin(), ls.end());
	for (pair<int, int> a : ls){
		ans.push_back(char(a.second+97));
		solve(lets[c][a.second]);
		ans.push_back('-');
	}
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n; cin >> n;
	vector<long> t;
	for (int j = 0; j < 26; j++) t.push_back(0);
	lets.push_back(t); endb.push_back(false); length.push_back(-100);
	for (int i = 0; i < n; i++){
		string s; cin >> s;
		add(0, 0, s);
	}
	solve(0);
	long count = ans.size();
	while (ans[count-1] == '-'){
		count--;
	}
	cout << count << endl;
	for (int i = 0; i < count; i++){
		cout << ans[i] << endl;
	}
}

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

printer.cpp: In function 'void add(long int, int, std::string)':
printer.cpp:20:8: 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 (i == s.length()){
      |      ~~^~~~~~~~~~~~~

• 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: 0 / 10
• Subtask 10: 0 / 10