# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59202 | TAMREF | Type Printer (IOI08_printer) | C++11 | 322 ms | 51556 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 mx = 25000 * 20 + 5;
const int root = 0;
const int hi = 25;
struct node{
bool is_leaf;
char now;
int nxt[26];
int hei;
} trie[mx];
int num_trie = root;
void trie_insert(string& S){
int now = root;
for(char &c : S){
int &nxt = trie[now].nxt[c - 'a'];
if(!nxt){
nxt = ++num_trie;
}
now = nxt;
trie[nxt].now = c;
}
trie[now].is_leaf = true;
}
void dfs_sort_by_height(int x){
# | 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... |