oj.uz

Submission #1099875

# Submission time Handle Problem Language Result Execution time Memory
1099875 2024-10-12T05:41:53 Z horezushol Type Printer (IOI08_printer) C++17
100 / 100
 222 ms 96640 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define SZ(x) int((x).size())
const char nl = '\n';
using ll = long long;
using namespace std;

const int N = 25000 * 21;
int nam = 0;
int n;
int trie[N][27];
int dep[N][27];
bool stop[N];

void add(string s) {
	int x = 0;
	for (auto c : s) {
		if (!trie[x][c-'a']) {
			trie[x][c-'a'] = ++nam;
		}
		dep[x][c-'a'] = max(dep[x][c-'a'], SZ(s));
		x = trie[x][c-'a'];
	}
	stop[x] = true;
}

vector<char> res;
int fine = 0;
void dfs(int x) {
	if (stop[x]) {
		res.push_back('P');
		fine ++;
	}
	vector<int> topo(26, 0);
	iota(topo.begin(), topo.end(), 0);
	sort(topo.begin(), topo.end(), [&](int a, int b) {
		return dep[x][a] < dep[x][b];
	});
	for (auto c : topo) {
		if (!trie[x][c]) {
			continue;
		}
		res.push_back(c + 'a');
		dfs(trie[x][c]);
	}
	if (fine != n) {
		res.push_back('-');
	}
}

void verkefni() {
	cin >> n;
	for (int i = 0; i < n; i ++) {
		string s; cin >> s;
		add(s);
	}
	dfs(0);
	cout << SZ(res) << nl;
	for (auto el : res) {
		cout << el << nl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tst = 1;
// 	cin >> tst;
	while (tst --) {
		verkefni();
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1880 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5720 KB Output is correct
2 Correct 20 ms 12220 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 14440 KB Output is correct
2 Correct 13 ms 3420 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 35320 KB Output is correct
2 Correct 124 ms 81352 KB Output is correct
3 Correct 63 ms 41940 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 27740 KB Output is correct
2 Correct 212 ms 96640 KB Output is correct
3 Correct 128 ms 47212 KB Output is correct
4 Correct 222 ms 90912 KB Output is correct