Pagini recente » Borderou de evaluare (job #1188779) | Borderou de evaluare (job #879587) | Borderou de evaluare (job #1615123) | Borderou de evaluare (job #63489) | Borderou de evaluare (job #2801413)
Borderou de evaluare (job #2801413)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int)':
main.cpp:168:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
168 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::afis_adj(int)':
main.cpp:174:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
174 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::BFS(int)':
main.cpp:254:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
254 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::topSort(int*, std::queue<int>)':
main.cpp:396:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
396 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)':
main.cpp:427:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
427 | if (top > degree_seq.size()) // daca valoarea primului element este mare decat numarul de elemente ramase, nu putem construi un astfel de graf
| ~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:430:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
430 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::Dijkstra()':
main.cpp:571:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
571 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 5ms | 5054kb | OK | 10 |
2 | 15ms | 5156kb | OK | 10 |
3 | 6ms | 5156kb | OK | 10 |
4 | 19ms | 5156kb | OK | 10 |
5 | 31ms | 5681kb | OK | 10 |
6 | 56ms | 6082kb | OK | 10 |
7 | 81ms | 6328kb | OK | 10 |
8 | 1002ms | 7872kb | Time limit exceeded | 0 |
9 | 117ms | 7565kb | OK | 10 |
10 | 256ms | 9924kb | OK | 10 |
Punctaj total | 90 |