Pagini recente » Borderou de evaluare (job #1332664) | Borderou de evaluare (job #539028) | Borderou de evaluare (job #3255109) | Borderou de evaluare (job #2321413) | Borderou de evaluare (job #2820063)
Borderou de evaluare (job #2820063)
Raport evaluator
Compilare:
main.cpp:163: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas]
163 | #pragma region Definitions
|
main.cpp:963: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
963 | #pragma endregion
|
main.cpp:982: warning: ignoring '#pragma region Public_Methods_Calls' [-Wunknown-pragmas]
982 | #pragma region Public_Methods_Calls
|
main.cpp:1141: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
1141 | #pragma endregion
|
main.cpp: In constructor 'Graph::Graph(int, int, bool, bool, bool)':
main.cpp:73:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder]
73 | int nrEdges;
| ^~~~~~~
main.cpp:68:10: warning: 'bool Graph::isDirected' [-Wreorder]
68 | bool isDirected;
| ^~~~~~~~~~
main.cpp:80:5: warning: when initialized here [-Wreorder]
80 | 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:337:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
337 | for (int i = 0; i < adjacencyList[src].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:342:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
342 | 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:664:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
664 | 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:775: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]
775 | if (degrees[0] > degrees.size() - 1)
main.cpp: In function 'int main()':
main.cpp:970:23: warning: unused variable 'start' [-Wunused-variable]
970 | int nodes, edges, start, operations;
| ^~~~~
main.cpp:970:30: warning: unused variable 'operations' [-Wunused-variable]
970 | int nodes, edges, start, operations;
| ^~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
2 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
3 | 11ms | 1048kb | Raspuns corect! | 10 | 10 |
4 | 101ms | 7725kb | Raspuns corect! | 10 | 10 |
5 | 187ms | 15794kb | Raspuns corect! | 10 | 10 |
6 | 636ms | 47738kb | Raspuns corect! | 10 | 10 |
7 | 140ms | 7835kb | Raspuns corect! | 10 | 0 |
8 | 801ms | 62205kb | Time limit exceeded | 0 |
9 | 804ms | 31174kb | Time limit exceeded | 0 | 0 |
10 | 691ms | 65552kb | Memory limit exceeded | 0 |
Punctaj total | 60 |