Pagini recente » Borderou de evaluare (job #2518221) | Borderou de evaluare (job #232127) | Borderou de evaluare (job #1546545) | Borderou de evaluare (job #1688429) | Borderou de evaluare (job #2818471)
Borderou de evaluare (job #2818471)
Raport evaluator
Compilare:
main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graph)':
main.cpp:32:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for(int i = 0; i < graph.adjacent.size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In constructor 'Graph::Graph(std::vector<std::tuple<int, int, int> >&, int&, bool)':
main.cpp:64:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
64 | for(auto[node1, node2, cost]: data) {
| ^
main.cpp: In member function 'std::vector<std::__cxx11::list<Graph::nodeStruct> > Graph::transposed()':
main.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::connected()':
main.cpp:162:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
162 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::stack<int> Graph::topologicalSort()':
main.cpp:181:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
181 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::pair<std::vector<std::vector<int> >, std::vector<std::pair<int, int> > > Graph::biconnected()':
main.cpp:192:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
192 | for (int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()':
main.cpp:202:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
202 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::bellmanFord(int)':
main.cpp:248:37: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
248 | if(visited[i.node2] >= adjacent.size())
main.cpp: In member function 'std::pair<std::vector<Graph::nodeStruct>, int> Graph::minimumTreeKruskall()':
main.cpp:260:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
260 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp:273:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
273 | if(nrEdges == adjacent.size() - 1)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havelHakimi(std::deque<int, std::allocator<int> >)':
main.cpp:303:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int, std::allocator<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
303 | if(i >= degrees.size())
| ~~^~~~~~~~~~~~~~~~~
main.cpp:311:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int, std::allocator<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
311 | for(int i = 0; i < degrees.size(); i++) {
| ~~^~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::costMatrix()':
main.cpp:320:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
320 | for(int i = 0; i < adjacent.size(); i++) {
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::royfloyd()':
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | Incorect | 0 |
2 | 2ms | 184kb | OK | 5 |
3 | 11ms | 200kb | OK | 5 |
4 | 751ms | 212kb | Time limit exceeded | 0 |
5 | 751ms | 200kb | Time limit exceeded | 0 |
6 | 750ms | 200kb | Time limit exceeded | 0 |
7 | 750ms | 200kb | Time limit exceeded | 0 |
8 | 750ms | 200kb | Time limit exceeded | 0 |
9 | 751ms | 200kb | Time limit exceeded | 0 |
10 | 751ms | 200kb | Time limit exceeded | 0 |
11 | 750ms | 200kb | Time limit exceeded | 0 |
12 | 751ms | 200kb | Time limit exceeded | 0 |
13 | 751ms | 200kb | Time limit exceeded | 0 |
14 | 751ms | 262kb | Time limit exceeded | 0 |
15 | 751ms | 200kb | Time limit exceeded | 0 |
16 | 751ms | 200kb | Time limit exceeded | 0 |
17 | 751ms | 200kb | Time limit exceeded | 0 |
18 | 750ms | 200kb | Time limit exceeded | 0 |
19 | 750ms | 200kb | Time limit exceeded | 0 |
20 | 750ms | 253kb | Time limit exceeded | 0 |
Punctaj total | 10 |