Pagini recente » Borderou de evaluare (job #1011906) | Borderou de evaluare (job #3027229) | Borderou de evaluare (job #2214976) | Borderou de evaluare (job #2379868) | Borderou de evaluare (job #2792221)
Borderou de evaluare (job #2792221)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int)':
main.cpp:103:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
103 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::afis_adj(int)':
main.cpp:109:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
109 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::BFS(int)':
main.cpp:125:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
125 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::sccUtil(int, int*, int*, std::stack<int>*, bool*)':
main.cpp:206:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
206 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::output_scc()':
main.cpp:267:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
267 | for (int j = 0; j < vec_scc[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::topSort()':
main.cpp:287:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
287 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 11ms | 8736kb | OK | 10 |
2 | 10ms | 8695kb | OK | 10 |
3 | 12ms | 8704kb | OK | 10 |
4 | 12ms | 8740kb | OK | 10 |
5 | 10ms | 8826kb | OK | 10 |
6 | 20ms | 8826kb | OK | 10 |
7 | 27ms | 9150kb | OK | 10 |
8 | 36ms | 9342kb | OK | 10 |
9 | 102ms | 9863kb | OK | 10 |
10 | 142ms | 10272kb | OK | 10 |
Punctaj total | 100 |