Pagini recente » Borderou de evaluare (job #388809) | Borderou de evaluare (job #1015083) | Borderou de evaluare (job #1285494) | Borderou de evaluare (job #246336) | Borderou de evaluare (job #2787517)
Borderou de evaluare (job #2787517)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, bool*)':
main.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findBiconnectedComponents(int, int, int, std::vector<std::vector<int> >&, int*, int*, bool*, std::stack<int>&)':
main.cpp:68:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::getMinimumDistances(int)':
main.cpp:177:31: 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 < edges[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 1ms | 184kb | OK | 10 |
2 | 1ms | 184kb | OK | 10 |
3 | 1ms | 184kb | OK | 10 |
4 | 1ms | 184kb | OK | 10 |
5 | 14ms | 438kb | OK | 10 |
6 | 43ms | 1638kb | OK | 10 |
7 | 144ms | 4022kb | OK | 10 |
8 | 171ms | 6717kb | OK | 10 |
9 | 710ms | 11870kb | OK | 10 |
10 | 708ms | 11837kb | OK | 10 |
Punctaj total | 100 |