Borderou de evaluare (job #2820464)

Utilizator andrei.gatejAndrei Gatej andrei.gatej Data 20 decembrie 2021 14:15:23
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::criticalConnDFS(int, int, std::vector<std::vector<int> >&, std::vector<bool>&, bool&, std::stack<std::pair<int, int> >&, std::vector<std::deque<int> >&)': main.cpp:283:70: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 283 | 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::vector<std::vector<std::pair<int, int> > >&, const int&)': main.cpp:536: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] 536 | while (!edgesWithMinCost.empty() && result.size() < expectedEdges) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::BFS(const std::vector<std::vector<int> >&, const int&, std::vector<bool>&, std::vector<int>&, int&)': main.cpp:637:7: warning: unused variable 'processingTimestamp' [-Wunused-variable] 637 | int processingTimestamp = 0; | ^~~~~~~~~~~~~~~~~~~ main.cpp: In static member function 'static void Graph::printEulerianPath()': main.cpp:725:28: warning: comparison of integer expressions of different signedness: 'const int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 725 | if (maxRequiredArrSize > nodesAndEdges.size()) { | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:745:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 745 | for (int i = 0; i < result.size() - 1; i++) { | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void solveMinEdgesRequiredFromSource()': main.cpp:931:15: warning: unused variable 'OUTPUT_FILE_NAME' [-Wunused-variable] 931 | const char* OUTPUT_FILE_NAME = "bfs.out"; | ^~~~~~~~~~~~~~~~ main.cpp: In function 'void solveStronglyConnectedComponents()': main.cpp:1043:15: warning: unused variable 'OUTPUT_FILE_NAME' [-Wunused-variable] 1043 | const char* OUTPUT_FILE_NAME = "ctc.out"; | ^~~~~~~~~~~~~~~~ main.cpp: In lambda function: main.cpp:1098:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1098 | if (crtNodeDeg > degSequence.size()) { | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbCorect10
22ms184kbCorect10
32ms184kbCorect10
42ms184kbCorect10
52ms184kbCorect10
6197ms6332kbCorect10
7379ms12312kbCorect10
864ms2572kbCorect10
959ms2772kbCorect10
10340ms9777kbCorect10
Punctaj total100

Ceva nu functioneaza?