Pagini recente » Borderou de evaluare (job #1659372) | Borderou de evaluare (job #1679281) | Borderou de evaluare (job #823134) | Borderou de evaluare (job #1668388) | Borderou de evaluare (job #2807115)
Borderou de evaluare (job #2807115)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)':
main.cpp:209:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
209 | 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:226: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]
226 | for(int i=0; i<biconnected_components.size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Strongly_Connected_Components(char*)':
main.cpp:243:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
243 | for(int i = 0; i < strongly_connected_components.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:245:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
245 | for(int j = 0; j < strongly_connected_components[i].size(); j++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Critical_Edges(char*)':
main.cpp:302:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
302 | for(int i = 0; i < critical_edges.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp:304:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
304 | 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:393:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
393 | 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:471:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
471 | 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:569:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
569 | 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:620:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
620 | 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:697:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
697 | 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:763: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]
763 | 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:774: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]
774 | 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 | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 2ms | 184kb | OK | 10 |
4 | 2ms | 184kb | OK | 10 |
5 | 25ms | 978kb | OK | 10 |
6 | 54ms | 1662kb | OK | 10 |
7 | 73ms | 2383kb | OK | 10 |
8 | 173ms | 4591kb | OK | 10 |
9 | 111ms | 4120kb | OK | 10 |
10 | 359ms | 6639kb | OK | 10 |
Punctaj total | 100 |