Borderou de evaluare (job #2819917)

Utilizator vlad_dimaVlad Dima vlad_dima Data 19 decembrie 2021 13:43:47
Problema Paduri de multimi disjuncte Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

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:669:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 669 | 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:1022:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1022 | for (int i = 1; i < rezultat.size(); i++) | ~~^~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms188kbFisier de iesire lipsa00
22ms184kbFisier de iesire lipsa00
31ms184kbFisier de iesire lipsa00
42ms184kbFisier de iesire lipsa00
52ms184kbFisier de iesire lipsa00
62ms184kbFisier de iesire lipsa0
72ms184kbFisier de iesire lipsa0
82ms184kbFisier de iesire lipsa00
92ms184kbFisier de iesire lipsa00
102ms184kbFisier de iesire lipsa00
Punctaj total0

Ceva nu functioneaza?