제출 #1293174

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293174		blackscreen1	Type Printer (IOI08_printer)	C++20	90 / 100	260 ms	277452 KiB

printer

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
vector<char> cmd;
struct node {
	pair<int, pair<char, node*>> l[26];
	bool hv = 0;
	node () {
		iloop(0, 26) l[i] = {0, {'a' + i, nullptr}};
	}
	void upd(string s, ll cid) {
		if (cid == (ll)s.length()) {hv = 1; return;}
		ll tu = -1;
		iloop(0, 26) if (l[i].second.first == s[cid]) tu = i;
		if (l[tu].second.second == nullptr) l[tu].second.second = new node();
		l[tu].second.second->upd(s, cid + 1);
		l[tu].first = max(l[tu].first, (int)s.length());
		sort(l, l + 26);
	}
	void traverse() {
		if (hv) cmd.push_back('P');
		iloop(0, 26) if (l[i].second.second != nullptr) {
			cmd.push_back(l[i].second.first);
			l[i].second.second->traverse();
			cmd.push_back('-');
		}
	}
};
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n;
	cin >> n;
	node root = node();
	string s;
	iloop(0, n) {
		cin >> s;
		root.upd(s, 0);
	}
	root.traverse();
	while (cmd.back() == '-') cmd.pop_back();
	cout << cmd.size() << "\n";
	for (auto it : cmd) cout << it << "\n";
}

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