# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333050 | FutymyClone | Type Printer (IOI08_printer) | C++14 | 216 ms | 108128 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
struct Trie {
Trie *node[26];
int num, priority;
bool isEnd;
Trie() {
for (int i = 0; i < 26; i++) node[i] = NULL;
num = 0; priority = 100000; isEnd = false;
}
} *root = new Trie();
int n, nNode = 0;
vector <char> ans;
vector <string> vec;
void add (string s, int id) {
Trie *cur = root;
for (int i = 0; i < s.length(); i++) {
if (cur -> node[s[i] - 'a'] == NULL) {
cur -> node[s[i] - 'a'] = new Trie();
cur = cur -> node[s[i] - 'a'];
cur -> num = ++nNode;
cur -> priority = id;
} else {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |