Borderou de evaluare (job #2801412)

Utilizator dascalu_maraDascalu Mara Elena dascalu_mara Data 16 noiembrie 2021 10:44:42
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

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
113ms5185kbIncorect0
26ms5156kbIncorect0
311ms5185kbIncorect0
43ms5156kbIncorect0
526ms5554kbIncorect0
639ms6033kbIncorect0
765ms6246kbIncorect0
81003ms7843kbTime limit exceeded0
9115ms7364kbIncorect0
10492ms9834kbIncorect0
Punctaj total0

Ceva nu functioneaza?