Pagini recente » Borderou de evaluare (job #2979967) | Borderou de evaluare (job #1824834) | Borderou de evaluare (job #1421232) | Borderou de evaluare (job #959661) | Borderou de evaluare (job #2818367)
Borderou de evaluare (job #2818367)
Raport evaluator
Compilare:
main.cpp: In member function 'void graf::construire_graf(int)':
main.cpp:53:15: warning: unused variable 'cost' [-Wunused-variable]
53 | int u, v, cost;
| ^~~~
main.cpp: In member function 'void graf::bfs(int)':
main.cpp:114:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
114 | 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:151:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
151 | 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:263:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
263 | 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:275:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
275 | 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:311:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
311 | 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:389:13: warning: unused variable 'dist' [-Wunused-variable]
389 | int dist = s.begin() -> first;
| ^~~~
main.cpp: In member function 'void graf::bellmanford()':
main.cpp:487:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
487 | for(int k = 0; k < vecini[coada.front()].size(); k ++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void graf::ciclu_eulerian()':
main.cpp:670:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
670 | for(int i = 0; i < rasp.size() - 1; i ++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:712:9: warning: unused variable 's' [-Wunused-variable]
712 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 5 |
2 | 2ms | 184kb | OK | 5 |
3 | 2ms | 184kb | OK | 5 |
4 | 2ms | 184kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 2ms | 184kb | OK | 5 |
7 | 29ms | 6578kb | OK | 5 |
8 | 29ms | 6578kb | OK | 5 |
9 | 16ms | 2297kb | OK | 5 |
10 | 16ms | 2297kb | OK | 5 |
11 | 16ms | 2297kb | OK | 5 |
12 | 16ms | 2297kb | OK | 5 |
13 | 16ms | 2297kb | OK | 5 |
14 | 16ms | 2297kb | OK | 5 |
15 | 332ms | 19140kb | OK | 5 |
16 | 269ms | 18939kb | OK | 5 |
17 | 181ms | 18817kb | OK | 5 |
18 | 458ms | 19173kb | OK | 5 |
19 | 317ms | 19001kb | OK | 5 |
20 | 433ms | 19058kb | OK | 5 |
Punctaj total | 100 |