Pagini recente » Borderou de evaluare (job #2969472) | Borderou de evaluare (job #2664078) | Borderou de evaluare (job #2961374) | Borderou de evaluare (job #2259576) | Borderou de evaluare (job #2802429)
Borderou de evaluare (job #2802429)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<std::__cxx11::list<Graph::nodeStruct> > Graph::transposed()':
main.cpp:20: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]
20 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In constructor 'Graph::Graph(std::vector<std::tuple<int, int, int> >&, int, bool)':
main.cpp:83:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
83 | for(auto[node1, node2, cost]: data) {
| ^
main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graph)':
main.cpp:91: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]
91 | for(int i = 0; i < graph.adjacent.size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::connected()':
main.cpp:102: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]
102 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::stack<int> Graph::topologicalSort()':
main.cpp:120: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]
120 | 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:131:27: 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]
131 | for (int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()':
main.cpp:141: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]
141 | for(int i = 0; i < adjacent.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::dijkstraBellman(int)':
main.cpp:167:44: 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]
167 | if(visited[i.node] >= adjacent.size())
main.cpp: In function 'int main()':
main.cpp:194:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
194 | else for(int i = 1; i < dijks.first.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp:181:15: warning: unused variable 'start' [-Wunused-variable]
181 | int n, m, start;
| ^~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 1ms | 184kb | OK | 10 |
2 | 1ms | 184kb | Incorect | 0 |
3 | 1ms | 184kb | Incorect | 0 |
4 | 1ms | 184kb | Incorect | 0 |
5 | 33ms | 1617kb | Incorect | 0 |
6 | 45ms | 2875kb | Incorect | 0 |
7 | 60ms | 3809kb | Incorect | 0 |
8 | 1003ms | 8388kb | Time limit exceeded | 0 |
9 | 123ms | 5664kb | OK | 10 |
10 | 195ms | 12304kb | Memory limit exceeded | 0 |
Punctaj total | 20 |