Pagini recente » Borderou de evaluare (job #678568) | Borderou de evaluare (job #1595889) | Borderou de evaluare (job #1120424) | Borderou de evaluare (job #2448353) | Borderou de evaluare (job #2806725)
Borderou de evaluare (job #2806725)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)':
main.cpp:129:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
129 | 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:146: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]
146 | for(int i=0; i<biconnected_components.size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::print_Strongly_Connected_Components(char*)':
main.cpp:163:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
163 | for(int i = 0; i < strongly_connected_components.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:165:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
165 | for(int j = 0; j < strongly_connected_components[i].size(); j++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::create_Minimum_Paths(int)':
main.cpp:244:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
244 | 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:322:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
322 | 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:420:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
420 | 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: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[nod].size();i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:517:41: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
517 | g.read_Oriented_Graph_Without_Costs("../sortaret.in");
| ^~~~~~~~~~~~~~~~
main.cpp:519:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
519 | g.print_Topological_Sort("../sortaret.out");
| ^~~~~~~~~~~~~~~~~
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 | 6ms | 331kb | OK | 10 |
6 | 11ms | 507kb | OK | 10 |
7 | 20ms | 1032kb | OK | 10 |
8 | 30ms | 1404kb | OK | 10 |
9 | 59ms | 2510kb | OK | 10 |
10 | 92ms | 3215kb | OK | 10 |
Punctaj total | 100 |