Borderou de evaluare (job #2802009)

Utilizator andrei.gatejAndrei Gatej andrei.gatej Data 17 noiembrie 2021 13:04:52
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::criticalConnDFS(int, int, std::vector<std::vector<int> >&)': main.cpp:243:72: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 243 | 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:474: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] 474 | while (!edgesWithMinCost.empty() && result.size() < expectedEdges) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~ main.cpp: In lambda function: main.cpp:693:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 693 | if (crtNodeDeg > degSequence.size()) { | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK10
21ms184kbIncorect0
31ms184kbIncorect0
41ms184kbIncorect0
518ms1581kbIncorect0
659ms2609kbIncorect0
769ms3706kbIncorect0
8172ms7860kbIncorect0
9108ms5492kbOK10
10263ms11468kbIncorect0
Punctaj total20

Ceva nu functioneaza?