Submission #521342

#	Time	Username	Problem	Language	Result	Execution time	Memory
521342		vlad_TT	Type Printer (IOI08_printer)	C++17	0 / 100	75 ms	35896 KiB

printer

#include <iostream>

const int SIGMA = 26;

struct Trie {
  int words;
  Trie* children[SIGMA];

  Trie() {
    words = 0;
    for (int i = 0; i < SIGMA; i++) {
      children[i] = NULL;
    }
  }
};

void insert(Trie* root, char* S) {
  if (*S == '\0') {
    root->words++;
  } else {
    if (root->children[S[0] - 'a'] == NULL) {
      root->children[S[0] - 'a'] = new Trie();
    }
    insert(root->children[S[0] - 'a'], S + 1);
  }
}

void dfs(Trie* root) {
  for (int i = 1; i <= root->words; i++) {
    std::cout << "P\n";
  }
  for (int i = 0; i < SIGMA; i++) {
    if (root->children[i] != NULL) {
      std::cout << char(i + 'a') << "\n";
      dfs(root->children[i]);
      std::cout << "-\n";
    }
  }
}

int main() {
  Trie root;
  char* S = new char[20 + 1];
  int n;
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    std::cin >> S;
    insert(&root, S);
  }
  dfs(&root);
  return 0;
}

• 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