Pagini recente » Borderou de evaluare (job #1951920) | Borderou de evaluare (job #1539883) | Borderou de evaluare (job #2604243) | Borderou de evaluare (job #1117980) | Borderou de evaluare (job #2739109)
Borderou de evaluare (job #2739109)
Raport evaluator
Compilare:
main.cpp: In function 'void prim()':
main.cpp:46:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(int i=0;i<n;++i)
^~~
main.cpp:49:9: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
Min[0]=0;//setez 0 ca fiind radafina si minimul lui ca 0 ca sa fie ales primul in arborele partial
^~~
main.cpp: In function 'int pick(double*, bool*)':
main.cpp:37:12: warning: 'node_picked' may be used uninitialized in this function [-Wmaybe-uninitialized]
return node_picked;
^~~~~~~~~~~
main.cpp: In function 'void prim()':
main.cpp:103:41: warning: 'parent' may be used uninitialized in this function [-Wmaybe-uninitialized]
if(next[frunza]==parent||prev[frunza]==parent)//daca sunt puncte consecutive in poligonul curent (formeaza o latura , nu o diagonala)
~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 3ms | 131kb | Corect | 4 |
2 | 3ms | 131kb | Costul muchiilor afisate nu este minim | 0 |
3 | 3ms | 131kb | Corect | 4 |
4 | 3ms | 131kb | Mutare invalida | 0 |
5 | 3ms | 131kb | Corect | 4 |
6 | 3ms | 131kb | Mutare invalida | 0 |
7 | 3ms | 131kb | Cost gresit | 0 |
8 | 3ms | 131kb | Mutare invalida | 0 |
9 | 3ms | 131kb | Cost gresit | 0 |
10 | 3ms | 131kb | Mutare invalida | 0 |
11 | 3ms | 131kb | Corect | 4 |
12 | 3ms | 131kb | Mutare invalida | 0 |
13 | 4ms | 131kb | Cost gresit | 0 |
14 | 4ms | 131kb | Mutare invalida | 0 |
15 | 3ms | 262kb | Cost gresit | 0 |
16 | 4ms | 131kb | Mutare invalida | 0 |
17 | 4ms | 131kb | Cost gresit | 0 |
18 | 4ms | 262kb | Mutare invalida | 0 |
19 | 18ms | 262kb | Cost gresit | 0 |
20 | 22ms | 262kb | Mutare invalida | 0 |
21 | 20ms | 262kb | Cost gresit | 0 |
22 | 23ms | 262kb | Mutare invalida | 0 |
23 | 20ms | 262kb | Cost gresit | 0 |
24 | 23ms | 262kb | Mutare invalida | 0 |
25 | 253ms | 393kb | Cost gresit | 0 |
26 | 279ms | 262kb | Mutare invalida | 0 |
27 | 192ms | 262kb | Cost gresit | 0 |
28 | 244ms | 262kb | Mutare invalida | 0 |
29 | 306ms | 262kb | Cost gresit | 0 |
30 | 373ms | 393kb | Mutare invalida | 0 |
31 | 301ms | 262kb | Cost gresit | 0 |
32 | 386ms | 393kb | Mutare invalida | 0 |
33 | 225ms | 262kb | Cost gresit | 0 |
34 | 280ms | 393kb | Mutare invalida | 0 |
35 | 227ms | 393kb | Cost gresit | 0 |
36 | 285ms | 393kb | Mutare invalida | 0 |
37 | 293ms | 393kb | Cost gresit | 0 |
38 | 319ms | 393kb | Mutare invalida | 0 |
39 | 295ms | 262kb | Cost gresit | 0 |
40 | 341ms | 393kb | Mutare invalida | 0 |
Punctaj total | 16 |