Pagini recente » Borderou de evaluare (job #2820529) | Borderou de evaluare (job #2688568) | Borderou de evaluare (job #155248) | Borderou de evaluare (job #1064682) | Borderou de evaluare (job #2817222)
Borderou de evaluare (job #2817222)
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:65:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
65 | for(auto[node1, node2, cost]: data) {
| ^
main.cpp: In member function 'std::vector<std::__cxx11::list<Graph::nodeStruct> > Graph::transposed()':
main.cpp:73: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]
73 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::connected()':
main.cpp:163: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]
163 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::stack<int> Graph::topologicalSort()':
main.cpp:182: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]
182 | 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:193: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]
193 | for (int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()':
main.cpp:203: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]
203 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::bellmanFord(int)':
main.cpp:249: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]
249 | if(visited[i.node2] >= adjacent.size())
main.cpp: In member function 'std::pair<std::vector<Graph::nodeStruct>, int> Graph::minimumTreeKruskall()':
main.cpp:261: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]
261 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp:274: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]
274 | if(nrEdges == adjacent.size() - 1)
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havelHakimi(std::deque<int, std::allocator<int> >)':
main.cpp:304: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]
304 | if(i >= degrees.size())
| ~~^~~~~~~~~~~~~~~~~
main.cpp:312: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]
312 | for(int i = 0; i < degrees.size(); i++) {
| ~~^~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::costMatrix()':
main.cpp:321: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]
321 | 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 | Killed by Signal 11 | 0 |
3 | 11ms | 200kb | Killed by Signal 11 | 0 |
4 | 127ms | 659kb | Incorect | 0 |
5 | 750ms | 1445kb | Time limit exceeded | 0 |
6 | 754ms | 1400kb | Time limit exceeded | 0 |
7 | 750ms | 921kb | Time limit exceeded | 0 |
8 | 750ms | 200kb | Time limit exceeded | 0 |
9 | 750ms | 929kb | Time limit exceeded | 0 |
10 | 750ms | 929kb | Time limit exceeded | 0 |
11 | 750ms | 913kb | Time limit exceeded | 0 |
12 | 750ms | 929kb | Time limit exceeded | 0 |
13 | 750ms | 929kb | Time limit exceeded | 0 |
14 | 750ms | 929kb | Time limit exceeded | 0 |
15 | 750ms | 671kb | Time limit exceeded | 0 |
16 | 750ms | 667kb | Time limit exceeded | 0 |
17 | 750ms | 663kb | Time limit exceeded | 0 |
18 | 750ms | 679kb | Time limit exceeded | 0 |
19 | 750ms | 671kb | Time limit exceeded | 0 |
20 | 754ms | 679kb | Time limit exceeded | 0 |
Punctaj total | 0 |