oj.uz

Submission #670597

# Submission time Handle Problem Language Result Execution time Memory
670597 2022-12-09T16:15:19 Z gokussjz Type Printer (IOI08_printer) C++17
80 / 100
 18 ms 23416 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 all(x)      x.begin(), x.end()
#define pb          push_back
#define sz(x)       (int)(x.size())
#define ll          long long
#define fi          first
#define se          second
#define lbd         lower_bound
#define ubd         upper_bound

template <typename T>
using ordered_set = tree<T, null_type,
      less<T>, rb_tree_tag,
      tree_order_statistics_node_update>;

const int MOD = 1e9 + 7;
const double eps = 1e-10;
const long long INF = 1e18;
const int N = 2e5 + 10;

const int MAX_NODES = 1e5 + 10;
const int MAX_ASCII_CODE = 26;
struct trie {
	int child[MAX_NODES][MAX_ASCII_CODE], tot, leaves[MAX_NODES], cnt[MAX_NODES][2];
	trie() {
		memset(child, -1, sizeof child);
		memset(leaves, 0, sizeof leaves);
		memset(cnt, 0, sizeof cnt);
		tot = 1;
	}
	void add(const string &s, const int msk) {
		int node = 0;
		for (const auto &ch : s) {
			int c = ch - 'a';
			if (child[node][c] == -1) child[node][c] = tot++;
			node = child[node][c];
			cnt[node][msk]++;
		}
		leaves[node]++;
	}

	bool search(const string &s) {
		int node = 0;
		for (const auto &ch : s) {
			int c = ch - 'a';
			if (child[node][c] == -1) return 0;
			node = child[node][c];
		}
		return leaves[node];
	}

	void reset() {
		memset(child, 0, sizeof(child[0]) * tot);
		memset(leaves, 0, sizeof(leaves[0]) * tot);
		tot = 1;
	}
} tr;

void solve() {
	int n;
	cin >> n;
	int mx = 0;
	string t;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		tr.add(s, 0);
		if (mx < sz(s)) {
			mx = sz(s);
			t = s;
		}
	}

	string ans;
	function<void(int, int)> dfs = [&](int u, int hi) {
		if (tr.leaves[u]) ans += 'P';
		for (int i = 0; i < 26; i++) {
			if (tr.child[u][i] != -1) {
				if (hi != -1 && hi < sz(t) && t[hi] - 'a' == i) continue;
				ans += char(i + 'a');
				dfs(tr.child[u][i], -1);
				ans += '-';
			}
		}
		if (hi != -1 && hi < sz(t)) {
			ans += t[hi];
			dfs(tr.child[u][t[hi] - 'a'], hi + 1);
		}
	};
	dfs(0, 0);
	cout << sz(ans) << '\n';
	for (auto ch : ans) cout << ch << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int tt = 1;
	//cin >> tt;
	while (tt--) {
		solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11604 KB Output is correct
2 Correct 5 ms 11676 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11568 KB Output is correct
2 Correct 5 ms 11604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11604 KB Output is correct
2 Correct 5 ms 11604 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11672 KB Output is correct
2 Correct 6 ms 11604 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11700 KB Output is correct
2 Correct 7 ms 11732 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11860 KB Output is correct
2 Correct 14 ms 12108 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12136 KB Output is correct
2 Correct 10 ms 11944 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 23380 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 17 ms 23416 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -