Submission #1249625

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249625		kaizisntme	Type Printer (IOI08_printer)	C++20	30 / 100	27 ms	19392 KiB

printer

#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#ifdef LOCAL
#include <algo/debug.h>
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;

const int N = 500005;
char ch;
struct Trie
{
  struct Node
  {
    int child[26];
    int exist, cnt;
  } nodes[N];
  vector<char> ans;

  int cur;
  Trie() : cur(0)
  {
    memset(nodes[0].child, -1, sizeof nodes[0].child);
    nodes[0].exist = nodes[0].cnt = 0;
  }

  int new_node()
  {
    cur++;
    memset(nodes[cur].child, -1, sizeof nodes[cur].child);
    nodes[cur].exist = nodes[cur].cnt = 0;
    return cur;
  }

  void add(string s)
  {
    int pos = 0;
    for (char x : s)
    {
      int c = x - 'a';
      if (nodes[pos].child[c] == -1)
        nodes[pos].child[c] = new_node();
      pos = nodes[pos].child[c];
      nodes[pos].cnt++;
    }
    nodes[pos].exist++;
  }

  void dfs(int pos, string &cur)
  {
    for (int i = 1; i <= nodes[pos].exist; ++i)
      ans.eb('P');
    for (int c = 0; c < 26; ++c)
    {
      if (pos == 0 && c == ch - 'a')
        continue;
      if (nodes[pos].child[c] == -1)
        continue;
      cur += char(c + 'a');
      ans.eb(char(c + 'a'));
      dfs(nodes[pos].child[c], cur);
      ans.eb('-');
      cur.pop_back();
    }
  }

  void dfs2(int pos, string &cur)
  {
    for (int i = 1; i <= nodes[pos].exist; ++i)
      ans.eb('P');
    for (int c = 0; c < 26; ++c)
    {
      if (pos == 0 && c != ch - 'a')
        continue;
      if (nodes[pos].child[c] == -1)
        continue;
      cur += char(c + 'a');
      ans.eb(char(c + 'a'));
      dfs(nodes[pos].child[c], cur);
      ans.eb('-');
      cur.pop_back();
    }
  }
};

Trie trie;
signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  int n, mx = 1;
  string s, cur = "";
  cin >> n;
  vector<char> v;
  for (int i = 1; i <= n; ++i)
  {
    cin >> s;
    trie.add(s);
    if (mx < s.size())
      mx = s.size(), ch = s[0];
  }
  trie.dfs(0, cur);
  cur = "";
  trie.dfs2(0, cur);
  vector<char> ans = trie.ans;
  while (ans.back() == '-')
    ans.pop_back();
  cout << ans.size() << '\n';
  for (char x : ans)
    cout << x << '\n';
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 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