oj.uz

Submission #790332

# Submission time Handle Problem Language Result Execution time Memory
790332 2023-07-22T14:48:42 Z pavement Type Printer (IOI08_printer) C++17
10 / 100
 35 ms 2344 KB 
#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;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, idx;
string cur, max_str, a[25005];
vector<char> ins;
map<char, int> lab;
map<char, char> rev;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> a[i];
		if (a[i].size() > max_str.size()) {
			max_str = a[i];
		}
	}
	for (char c : max_str) {
		if (lab.find(c) == lab.end()) lab[c] = idx++;
	}
	for (char c = 'a'; c <= 'z'; c++) {
		if (lab.find(c) == lab.end()) lab[c] = idx++;
	}
	for (auto i : lab) {
		rev[i.second + 'a'] = i.first;
	}
	for (int i = 1; i <= N; i++) {
		for (char &c : a[i]) c = lab[c] + 'a';
	}
	sort(a + 1, a + 1 + N, [](const auto &lhs, const auto &rhs) {
		bool is_substr = (lhs.size() < rhs.size() ? rhs.substr(0, lhs.size()) == lhs : lhs.substr(0, rhs.size()) == rhs);
		if (is_substr) return lhs.size() < rhs.size();
		return lhs > rhs;
	});
	for (int i = 1; i <= N; i++) {
		for (int j = (int)cur.size(); j < (int)a[i].size(); j++) {
			ins.pb(a[i][j]);
		}
		cur = a[i];
		ins.pb('P');
		if (i + 1 <= N) {
			while (!cur.empty() && a[i + 1].substr(0, cur.size()) != cur) {
				cur.ppb();
				ins.pb('-');
			}
		}
	}
	cout << ins.size() << '\n';
	for (char c : ins) cout << ('a' <= c && c <= 'z' ? rev[c] : c) << '\n';
}

Compilation message

printer.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Incorrect 1 ms 1108 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 2344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 1992 KB Output isn't correct
2 Halted 0 ms 0 KB -