Pagini recente » Borderou de evaluare (job #1500854) | Borderou de evaluare (job #1747603) | Borderou de evaluare (job #470219) | Borderou de evaluare (job #203903) | Borderou de evaluare (job #2805767)
Borderou de evaluare (job #2805767)
Raport evaluator
Compilare:
main.cpp: In member function 'void graf::construire_graf(int)':
main.cpp:46:15: warning: unused variable 'cost' [-Wunused-variable]
46 | int u, v, cost;
| ^~~~
main.cpp: In member function 'void graf::bfs(int)':
main.cpp:107:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
107 | for(int i = 0; i < lista[nod_s].size(); i++) //parcurgem lista de adiacenta a nodului nod_s
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void graf::dfs(int, bool*)':
main.cpp:144:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
144 | for(int i = 0; i < lista[nod].size(); i ++) //parcurgem lista de vecini a lui nod
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void graf::CtareC()':
main.cpp:253:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
253 | for (int j = 0; j < ctc[i].size(); j ++)
| ~~^~~~~~~~~~~~~~~
main.cpp: In member function 'void graf::compTC(int, std::vector<int>*, bool*, int&)':
main.cpp:265:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
265 | for(int i = 0; i < lista1[nod].size(); i ++) //pt. fiecare nod i din care se poate ajunge in nod
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'bool Havel_Hakimi(std::vector<int>&, int)':
main.cpp:301:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
301 | if (a > x.size()) //verificam daca avem suficiente elem. in vector. Daca nu => nu se poate crea graful
| ~~^~~~~~~~~~
main.cpp: In member function 'void graf::dijkstra()':
main.cpp:379:13: warning: unused variable 'dist' [-Wunused-variable]
379 | int dist = s.begin() -> first;
| ^~~~
main.cpp: In function 'int main()':
main.cpp:510:10: warning: unused variable 's' [-Wunused-variable]
510 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 36ms | 31776kb | Cost incorect | 0 |
2 | 37ms | 31776kb | Muchia nu se gaseste in graful initial | 0 |
3 | 35ms | 31789kb | Cost incorect | 0 |
4 | 35ms | 31793kb | Cost incorect | 0 |
5 | 37ms | 31801kb | Cost incorect | 0 |
6 | 165ms | 35209kb | Cost incorect | 0 |
7 | 289ms | 38060kb | Cost incorect | 0 |
8 | 79ms | 33128kb | Cost incorect | 0 |
9 | 80ms | 33214kb | Cost incorect | 0 |
10 | 260ms | 37113kb | Cost incorect | 0 |
Punctaj total | 0 |