Submission #529875

#	Time	Username	Problem	Language	Result	Execution time	Memory
529875		luanaamorim	Type Printer (IOI08_printer)	C++14	0 / 100	417 ms	17984 KiB

printer

#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) (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;
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;
}

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

int main()
{_
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s;
		add(s);
	}

 	solve(0, ' ');
}

Compilation message (stderr)

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: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10