oj.uz

Submission #790346

# Submission time Handle Problem Language Result Execution time Memory
790346 2023-07-22T14:59:40 Z pavement Type Printer (IOI08_printer) C++17
100 / 100
 577 ms 98068 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, max_idx;
string cur, max_str, a[25005], ord[25005];
vector<char> ins;
map<string, set<ii> > ss;

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];
			max_idx = i;
		}
		for (int j = 0; j <= (int)a[i].size(); j++) {
			ss[a[i].substr(0, j)].emplace(a[i].size(), i);
		}
	}
	for (int i = 1, idx = max_idx; i <= N; i++) {
		ord[N - i + 1] = a[idx];
		// remove idx
		for (int j = 0; j <= (int)a[idx].size(); j++) {
			ss[a[idx].substr(0, j)].erase(mp(a[idx].size(), idx));
		}
		if (i + 1 > N) continue;
		int to = -1;
		for (int j = (int)a[idx].size(); j >= 0; j--) {
			if (!ss[a[idx].substr(0, j)].empty()) {
				to = ss[a[idx].substr(0, j)].begin()->second;
				break;
			}
		}
		idx = to;
	}
	for (int i = 1; i <= N; i++) {
		for (int j = (int)cur.size(); j < (int)ord[i].size(); j++) {
			ins.pb(ord[i][j]);
		}
		cur = ord[i];
		ins.pb('P');
		if (i + 1 <= N) {
			while (!cur.empty() && ord[i + 1].substr(0, cur.size()) != cur) {
				cur.ppb();
				ins.pb('-');
			}
		}
	}
	cout << ins.size() << '\n';
	for (char c : ins) cout << c << '\n';
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 9 ms 1896 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB Output is correct
2 Correct 4 ms 2664 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3284 KB Output is correct
2 Correct 9 ms 3668 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7272 KB Output is correct
2 Correct 57 ms 13788 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 16196 KB Output is correct
2 Correct 80 ms 13444 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 37660 KB Output is correct
2 Correct 488 ms 82672 KB Output is correct
3 Correct 390 ms 56396 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 31592 KB Output is correct
2 Correct 577 ms 98068 KB Output is correct
3 Correct 429 ms 63952 KB Output is correct
4 Correct 447 ms 92408 KB Output is correct