Borderou de evaluare (job #1948685)
Raport evaluator
Compilare:
user.cpp: In function ‘void insertNode(Nod*&, int)’:
user.cpp:31:24: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(x->vecini[cuvant[y]] == NULL)
^
user.cpp:33:22: warning: array subscript has type ‘char’ [-Wchar-subscripts]
x->vecini[cuvant[y]] = new Nod();
^
user.cpp:38:22: warning: array subscript has type ‘char’ [-Wchar-subscripts]
x->vecini[cuvant[y]]->nr++;
^
user.cpp:42:33: warning: array subscript has type ‘char’ [-Wchar-subscripts]
insertNode(x->vecini[cuvant[y]], y + 1);
^
user.cpp: In function ‘void deleteNode(Nod*&, int)’:
user.cpp:63:22: warning: array subscript has type ‘char’ [-Wchar-subscripts]
x->vecini[cuvant[y]]->nr--;
^
user.cpp:65:32: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(isLeaf(x->vecini[cuvant[y]]) == true)
^
user.cpp:67:30: warning: array subscript has type ‘char’ [-Wchar-subscripts]
delete x->vecini[cuvant[y]];
^
user.cpp:68:23: warning: array subscript has type ‘char’ [-Wchar-subscripts]
x->vecini[cuvant[y]] = NULL;
^
user.cpp:73:33: warning: array subscript has type ‘char’ [-Wchar-subscripts]
deleteNode(x->vecini[cuvant[y]], y + 1);
^
user.cpp:75:32: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(isLeaf(x->vecini[cuvant[y]]) == true && x->vecini[cuvant[y]]->nr == 0)
^
user.cpp:75:65: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(isLeaf(x->vecini[cuvant[y]]) == true && x->vecini[cuvant[y]]->nr == 0)
^
user.cpp:77:30: warning: array subscript has type ‘char’ [-Wchar-subscripts]
delete x->vecini[cuvant[y]];
^
user.cpp:78:23: warning: array subscript has type ‘char’ [-Wchar-subscripts]
x->vecini[cuvant[y]] = NULL;
^
user.cpp: In function ‘int numberOfAparitions(Nod*&, int)’:
user.cpp:85:24: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(x->vecini[cuvant[y]] == NULL)
^
user.cpp:93:30: warning: array subscript has type ‘char’ [-Wchar-subscripts]
return x->vecini[cuvant[y]]->nr;
^
user.cpp:97:49: warning: array subscript has type ‘char’ [-Wchar-subscripts]
return numberOfAparitions(x->vecini[cuvant[y]], y + 1);
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 0ms | 464kb | OK | 5 | 5 |
| 2 | 0ms | 504kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 3 | 0ms | 544kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 4 | 0ms | 488kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 5 | 0ms | 508kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 6 | 0ms | 548kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 7 | 0ms | 688kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 8 | 4ms | 656kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 9 | 4ms | 1724kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 10 | 24ms | 5568kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 11 | 16ms | 932kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 12 | 40ms | 10992kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 13 | 40ms | 9076kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 14 | 36ms | 2576kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 15 | 36ms | 2356kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 16 | 32ms | Depăşit | Memory limit exceeded. | 0 |
| 17 | 4ms | 640kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 18 | 32ms | Depăşit | Memory limit exceeded. | 0 |
| 19 | 20ms | 672kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 20 | 32ms | Depăşit | Memory limit exceeded. | 0 |
| Punctaj total | 5 |
Solcan Mihai Andrei SolcanMihai