Pagini recente » Borderou de evaluare (job #457587) | Borderou de evaluare (job #973147) | Borderou de evaluare (job #856156) | Borderou de evaluare (job #672148) | Borderou de evaluare (job #2822201)
Borderou de evaluare (job #2822201)
Raport evaluator
Compilare:
main.cpp:202: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas]
202 | #pragma region Definitions
|
main.cpp:1002: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
1002 | #pragma endregion
|
main.cpp:1019: warning: ignoring '#pragma region Public_Methods_Calls' [-Wunknown-pragmas]
1019 | #pragma region Public_Methods_Calls
|
main.cpp:1179: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
1179 | #pragma endregion
|
main.cpp: In constructor 'Graph::Graph(int, int, bool, bool, bool)':
main.cpp:74:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder]
74 | int nrEdges;
| ^~~~~~~
main.cpp:69:10: warning: 'bool Graph::isDirected' [-Wreorder]
69 | bool isDirected;
| ^~~~~~~~~~
main.cpp:82:5: warning: when initialized here [-Wreorder]
82 | Graph(int n = 0, int m = 0, bool d = false, bool w = false, bool f = false) : nrNodes(n), nrEdges(m), isDirected(d), isWeighted(w), isFlowing(f) {}
| ^~~~~
main.cpp: In member function 'void Graph::removeEdge(int, int)':
main.cpp:376:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
376 | for (int i = 0; i < adjacencyList[src].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:381:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
381 | for (int i = 0; i < adjacencyList[dst].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::TarjanDFS(int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<bool>&, std::vector<std::vector<int> >&)':
main.cpp:703:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
703 | if (discOrder[edge.dest]) // if the adjacent node had been processed and is part of the current traversal path
| ^
main.cpp: In member function 'void Graph::HavelHakimi(std::vector<int>&, bool&)':
main.cpp:814:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
814 | if (degrees[0] > degrees.size() - 1)
main.cpp: In function 'int main()':
main.cpp:1009:23: warning: unused variable 'start' [-Wunused-variable]
1009 | int nodes, edges, start, operations;
| ^~~~~
main.cpp:1009:30: warning: unused variable 'operations' [-Wunused-variable]
1009 | int nodes, edges, start, operations;
| ^~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 184kb | OK | 5 |
| 2 | 2ms | 184kb | OK | 5 |
| 3 | 2ms | 184kb | OK | 5 |
| 4 | 16ms | 1372kb | OK | 5 |
| 5 | 2ms | 184kb | OK | 5 |
| 6 | 2ms | 184kb | OK | 5 |
| 7 | 2ms | 184kb | OK | 5 |
| 8 | 2ms | 184kb | OK | 5 |
| 9 | 2ms | 184kb | OK | 5 |
| 10 | 2ms | 184kb | OK | 5 |
| 11 | 40ms | 3399kb | OK | 5 |
| 12 | 30ms | 2580kb | OK | 5 |
| 13 | 49ms | 3858kb | OK | 5 |
| 14 | 58ms | 4730kb | OK | 5 |
| 15 | 68ms | 5259kb | OK | 5 |
| 16 | 87ms | 6443kb | OK | 5 |
| 17 | 118ms | 16433kb | OK | 5 |
| 18 | 44ms | 8183kb | OK | 5 |
| 19 | 49ms | 8302kb | OK | 5 |
| 20 | 116ms | 9691kb | OK | 5 |
| Punctaj total | 100 |