Borderou de evaluare (job #1731575)
Raport evaluator
Compilare:
user.cpp: In constructor ‘Trie::Trie()’:
user.cpp:13:10: warning: ‘Trie::isLeaf’ will be initialized after [-Wreorder]
bool isLeaf;
^
user.cpp:12:28: warning: ‘std::map<int, Trie*> Trie::children’ [-Wreorder]
map<int, struct Trie*> children;
^
user.cpp:15:5: warning: when initialized here [-Wreorder]
Trie() : isLeaf(false), children(){}
^
user.cpp: In function ‘int GradAsemanare(int)’:
user.cpp:29:63: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if( noduri[indexCuvinte[1]].size() <= gradAsemanare + aux )
^
user.cpp:37:67: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if( noduri[indexCuvinte[j]].size() <= gradAsemanare + aux ||
^
user.cpp: In function ‘int main()’:
user.cpp:113:22: warning: unused variable ‘lungimeMinimaCuvant’ [-Wunused-variable]
unsigned int lungimeMinimaCuvant = 2005;
^
user.cpp:114:13: warning: unused variable ‘indexCuvantMinim’ [-Wunused-variable]
int indexCuvantMinim;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | Depăşit | 1492kb | Time limit exceeded. | 0 |
2 | Depăşit | 1500kb | Time limit exceeded. | 0 |
3 | 188ms | 804kb | OK | 5 |
4 | 184ms | 800kb | OK | 5 |
5 | 188ms | 780kb | OK | 5 |
6 | 184ms | 780kb | OK | 5 |
7 | Depăşit | 1960kb | Time limit exceeded. | 0 |
8 | Depăşit | 2000kb | Time limit exceeded. | 0 |
9 | Depăşit | 1992kb | Time limit exceeded. | 0 |
10 | Depăşit | 1496kb | Time limit exceeded. | 0 |
11 | Depăşit | 1384kb | Time limit exceeded. | 0 |
12 | Depăşit | 1612kb | Time limit exceeded. | 0 |
13 | Depăşit | 1500kb | Time limit exceeded. | 0 |
14 | Depăşit | 1612kb | Time limit exceeded. | 0 |
15 | Depăşit | 1500kb | Time limit exceeded. | 0 |
16 | Depăşit | 1484kb | Time limit exceeded. | 0 |
17 | Depăşit | 1572kb | Time limit exceeded. | 0 |
18 | Depăşit | 1588kb | Time limit exceeded. | 0 |
19 | Depăşit | 1516kb | Time limit exceeded. | 0 |
20 | Depăşit | 1512kb | Time limit exceeded. | 0 |
Punctaj total | 20 |