Borderou de evaluare (job #2819924)

Utilizator vlad_dimaVlad Dima vlad_dima Data 19 decembrie 2021 13:58:08
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graf::BFS(int)': main.cpp:197:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 197 | for (int i = 0; i < lsAd[nodCrt].size(); i++)///trec prin toate nodurile adiacente | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graf::BellmanFord(std::ifstream&, std::vector<int>&)': main.cpp:654:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 654 | if (cost[vecin.first] > cost[nodCrt] + vecin.second) //vecin.first -> nodul catre care duce arcul // vecin.second -> costul arcului | ^ main.cpp: In function 'void problemaBFS()': main.cpp:1007:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1007 | for (int i = 1; i < rezultat.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In function 'void problemaDijkstra()': main.cpp:1168:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1168 | for (int i = 2; i < drum.size(); i++) | ~~^~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
530ms1568kbOK10
654ms2568kbOK10
773ms3780kbOK10
8184ms7831kbOK10
9126ms6926kbOK10
10375ms10133kbOK10
Punctaj total100

Ceva nu functioneaza?