Pagini recente » Borderou de evaluare (job #100024) | Borderou de evaluare (job #2615133) | Borderou de evaluare (job #373439) | Borderou de evaluare (job #2840339) | Borderou de evaluare (job #2815998)
Borderou de evaluare (job #2815998)
Raport evaluator
Compilare:
main.cpp: In member function 'void graf::construire_graf(int)':
main.cpp:52:15: warning: unused variable 'cost' [-Wunused-variable]
52 | int u, v, cost;
| ^~~~
main.cpp: In member function 'void graf::bfs(int)':
main.cpp:113:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
113 | 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:150:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
150 | 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:262:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
262 | 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:274:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
274 | 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:310:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
310 | 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:388:13: warning: unused variable 'dist' [-Wunused-variable]
388 | int dist = s.begin() -> first;
| ^~~~
main.cpp: In member function 'void graf::bellmanford()':
main.cpp:486:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
486 | for(int k = 0; k < vecini[coada.front()].size(); k ++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void graf::ciclu_eulerian()':
main.cpp:669:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
669 | for(int i = 0; i < rasp.size() - 1; i ++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:674:9: warning: unused variable 's' [-Wunused-variable]
674 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 15ms | 9555kb | Raspuns corect! | 10 | 10 |
2 | 16ms | 9461kb | Raspuns corect! | 10 | 10 |
3 | 21ms | 9674kb | Raspuns corect! | 10 | 10 |
4 | 59ms | 11153kb | Raspuns corect! | 10 | 10 |
5 | 121ms | 12963kb | Raspuns corect! | 10 | 10 |
6 | 407ms | 20103kb | Raspuns corect! | 10 | 10 |
7 | 177ms | 14336kb | Raspuns gresit! | 0 | 0 |
8 | 541ms | 23760kb | Raspuns corect! | 10 |
9 | 487ms | 24260kb | Raspuns corect! | 10 | 20 |
10 | 662ms | 27291kb | Raspuns corect! | 10 |
Punctaj total | 80 |