Borderou de evaluare (job #2806237)

Utilizator ScobiolaRaduScobiola Radu ScobiolaRadu Data 22 noiembrie 2021 14:29:58
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In constructor 'Graf::Graf(bool)': main.cpp:73:19: warning: unused variable 'c' [-Wunused-variable] 73 | int x, y, c; | ^ main.cpp:67:16: warning: unused variable 'muchie' [-Wunused-variable] 67 | muchiecost muchie; | ^~~~~~ main.cpp: In member function 'void Graf::bfs()': main.cpp:94:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 94 | for (i = 0; i < v[nc].size(); i++) //parcurgerm vecinii lui nc | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs(int, int*)': main.cpp:114:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 114 | for (i = 0; i < v[nod].size(); i++) //parcurgem vecinii nodului, se marcheaza toata componenta conexa ca fiind vizitata | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfstop(int, int*, std::stack<int>&)': main.cpp:140:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 140 | for (i = 0; i < v[nod].size(); i++) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfsctc(int, int*, int)': main.cpp:170:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 170 | for (i = 0; i < v[nod].size(); i++) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::ordine(int, int*, std::stack<int>&)': main.cpp:193:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 193 | for (int i = 0; i < v[nod].size(); i++) | ~~^~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbKilled by Signal 110
22ms184kbKilled by Signal 110
32ms184kbKilled by Signal 110
42ms184kbKilled by Signal 110
52ms184kbKilled by Signal 110
6401ms2916kbCost incorect0
71002ms4743kbTime limit exceeded0
8170ms1245kbCost incorect0
993ms1429kbCorect10
10828ms4083kbCost incorect0
Punctaj total10

Ceva nu functioneaza?