Pagini recente » Borderou de evaluare (job #2944417) | Borderou de evaluare (job #976891) | Borderou de evaluare (job #1813814) | Borderou de evaluare (job #490102) | Borderou de evaluare (job #2806856)
Borderou de evaluare (job #2806856)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)':
main.cpp:177:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
177 | for(int i = 0; i < this->graph_adjacency_list[node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Biconnected_Components(char*)':
main.cpp:194:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::unordered_set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
194 | for(int i=0; i<biconnected_components.size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Strongly_Connected_Components(char*)':
main.cpp:211:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
211 | for(int i = 0; i < strongly_connected_components.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:213:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
213 | for(int j = 0; j < strongly_connected_components[i].size(); j++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Critical_Edges(char*)':
main.cpp:270:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
270 | for(int i = 0; i < critical_edges.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp:272:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
272 | for(int j = 0; j<critical_edges[i].size(); j++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::create_Minimum_Paths(int)':
main.cpp:348:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
348 | for(int i=0; i < this->graph_adjacency_list[curent].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFSBiconnected(int, int, int, std::vector<int>&, std::vector<int>&, std::vector<std::unordered_set<int> >&, std::stack<std::pair<int, int> >&)':
main.cpp:426:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
426 | for(int i=0; i<this->graph_adjacency_list[nodCurent].size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::tarjan(int, std::stack<int>&, std::vector<int>&, std::vector<int>&, int&, std::vector<int>&, std::vector<std::vector<int> >&)':
main.cpp:524:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
524 | for(int i=0; i<this->graph_adjacency_list[nod].size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFSSortareTopologica(int, std::vector<int>&, std::stack<int>&)':
main.cpp:575:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
575 | for(int i=0; i<this->graph_adjacency_list[nod].size();i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFSCriticals(int, int&, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
main.cpp:652:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
652 | for(int i = 0; i < graph_adjacency_list[nodCurent].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::create_APM(int&)':
main.cpp:718:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
718 | for(int j = 0; j < this->graph_adjacency_list_with_costs[rad].size(); j++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::introduce_in_APM(int, std::vector<int>&, std::vector<int>&)':
main.cpp:729:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
729 | for(int i = 0; i < this->graph_adjacency_list_with_costs[nod].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | Corect | 10 |
2 | 2ms | 184kb | Corect | 10 |
3 | 2ms | 184kb | Corect | 10 |
4 | 1ms | 184kb | Corect | 10 |
5 | 2ms | 184kb | Corect | 10 |
6 | 941ms | 4866kb | Corect | 10 |
7 | 1003ms | 9023kb | Time limit exceeded | 0 |
8 | 223ms | 2207kb | Corect | 10 |
9 | 64ms | 1925kb | Corect | 10 |
10 | 1004ms | 7376kb | Time limit exceeded | 0 |
Punctaj total | 80 |