oj.uz

Submission #529882

# Submission time Handle Problem Language Result Execution time Memory
529882 2022-02-23T23:47:53 Z luanaamorim Type Printer (IOI08_printer) C++14
10 / 100
 1000 ms 17876 KB 
#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <set>
#include <stack>
#include <bitset>
#define ll long long
#define INF (1e9)
#define MAX (int)(26 * (2e5 + 5))
#define MOD 1000000007
#define par pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(x) (int) ((x).size())
#define esq(x) (x<<1)
#define dir(x) ((x<<1)|1)
#define lsb(x) (x & -x)
#define W(x) cout << #x << ": " << x << endl
#define Wii(x) cout << x.first << ' ' << x.second << endl
#define _ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int n, t[MAX], trie[MAX][26], qnt, tot, resp, maxn[MAX];
string s;

void add(string s)
{
	int u = 0;
	for (char c : s)
	{
		c -= 'a';
		if (!trie[u][c]) trie[u][c] = ++qnt;
		u = trie[u][c];
	}

	t[u] = 1;
}

int a(int u)
{
	int nivel = 0;
	for (int i = 0; i < 26; i++)
	{
		if (!trie[u][i]) continue;
		if (nivel < 1 + a(trie[u][i]))
		{
			nivel = 1 + a(trie[u][i]);
			maxn[u] = i;
		}
	}

	return nivel;
}

void b(int u)
{
	++resp;
	if (t[u])
	{
		++tot;
		++resp;
	} 
	for (int i = 0; i < 26; i++)
	{
		if (!trie[u][i] || maxn[u] == i) continue;
		b(trie[u][i]);
		if (tot != n)
		{
			++resp;
		} 
	}

	if (trie[u][maxn[u]])
	{
		b(trie[u][maxn[u]]);
		if (tot != n) resp++;
	} 
}

void solve(int u, char c)
{
	if (u) printf("%c\n", c); 
	if (t[u])
	{
		printf("P\n");
		++tot;
	} 
	for (int i = 0; i < 26; i++)
	{
		if (!trie[u][i] || maxn[u] == i) continue;
		solve(trie[u][i], i+'a');
		if (tot != n)
			printf("-\n");
	}

	if (trie[u][maxn[u]])
	{
		solve(trie[u][maxn[u]], maxn[u]+'a');
		if (tot != n) cout << "-" << endl;
	} 
}

int main()
{_
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s;
		add(s);
	}
	a(0);
	b(0);
	cout << --resp << endl;
	tot = 0;
 	solve(0, ' ');
}

Compilation message

printer.cpp: In function 'void add(std::string)':
printer.cpp:38:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |   if (!trie[u][c]) trie[u][c] = ++qnt;
      |                ^
printer.cpp:38:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |   if (!trie[u][c]) trie[u][c] = ++qnt;
      |                            ^
printer.cpp:39:15: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |   u = trie[u][c];
      |               ^

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 332 KB too many deletions
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 340 KB too many deletions
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 332 KB too many deletions
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 332 KB too many deletions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 479 ms 1056 KB too many deletions
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 3024 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1024 ms 7500 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 17876 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 330 ms 14616 KB too many deletions
2 Halted 0 ms 0 KB -