Borderou de evaluare (job #2811369)

Utilizator andrei.gatejAndrei Gatej andrei.gatej Data 2 decembrie 2021 00:01:31
Problema Diametrul unui arbore Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::criticalConnDFS(int, int, std::vector<std::vector<int> >&)': main.cpp:249:72: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 249 | bool isCrtNodeArticulationPoint = isSolvingBiconnected == true && (lowestLevelReached[childNodeIdx] >= ingressTimestamp[crtNodeIdx]) || (lowestLevelReached[childNodeIdx] > ingressTimestamp[crtNodeIdx]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<int, std::vector<std::pair<int, int> > > Graph::getMSPAndTotalCost(std::__cxx11::list<std::pair<int, int> >*&, const int&)': main.cpp:480:53: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare] 480 | while (!edgesWithMinCost.empty() && result.size() < expectedEdges) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~ main.cpp: In lambda function: main.cpp:756:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 756 | if (crtNodeDeg > degSequence.size()) { | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbIncorect0
22ms184kbIncorect0
32ms184kbIncorect0
42ms184kbIncorect0
511ms806kbIncorect0
644ms2629kbIncorect0
768ms3649kbIncorect0
8116ms5447kbIncorect0
988ms6184kbIncorect0
10158ms7032kbIncorect0
Punctaj total0

Ceva nu functioneaza?