Pagini recente » Monitorul de evaluare | Borderou de evaluare (job #1011663) | Monitorul de evaluare | Profil andreicoolguy88 | Borderou de evaluare (job #1663259)
Borderou de evaluare (job #1663259)
Raport evaluator
Compilare:
user.cpp: In function ‘void addWord(const char*)’:
user.cpp:38:32: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(cur_node->f[cur_char] == 0) {
^
user.cpp:39:33: warning: array subscript has type ‘char’ [-Wchar-subscripts]
cur_node->f[cur_char] = new trie_node();
^
user.cpp:41:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
cur_node = cur_node->f[cur_char];
^
user.cpp: In function ‘int countMatchingPrefixes(const char*, int)’:
user.cpp:55:32: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(cur_node->f[cur_char] == 0) {
^
user.cpp:58:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
cur_node = cur_node->f[cur_char];
^
user.cpp:63:32: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(cur_node->f[cur_char] == 0) {
^
user.cpp:66:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
cur_node = cur_node->f[cur_char];
^
user.cpp:50:15: warning: unused variable ‘firstPos’ [-Wunused-variable]
const int firstPos = k * x;
^
user.cpp:51:15: warning: unused variable ‘secondPos’ [-Wunused-variable]
const int secondPos = min(k * (x + 1), k * p);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 12ms | 4268kb | OK | 10 |
| 2 | 4ms | 1228kb | OK | 10 |
| 3 | 8ms | 2372kb | OK | 10 |
| 4 | 100ms | 27460kb | OK | 10 |
| 5 | 196ms | 53436kb | OK | 10 |
| 6 | 408ms | 110560kb | OK | 10 |
| 7 | 668ms | 185896kb | OK | 10 |
| 8 | 680ms | 164900kb | OK | 10 |
| 9 | 712ms | 173004kb | OK | 10 |
| 10 | 708ms | 173016kb | OK | 10 |
| Punctaj total | 100 |