Pagini recente » Borderou de evaluare (job #2839410) | Borderou de evaluare (job #193117) | Borderou de evaluare (job #1932778) | Borderou de evaluare (job #2869458) | Borderou de evaluare (job #2790715)
Borderou de evaluare (job #2790715)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, bool*)':
main.cpp:177:23: 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[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:195:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
195 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findStronglyConnectedComponents(int, int&, int, std::vector<std::vector<int> >&, int*, int*, bool*, bool*, std::stack<int>&)':
main.cpp:236:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
236 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findCriticalEdges(int, int&, int, std::vector<std::vector<int> >&, int*, int*, bool*)':
main.cpp:272:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
272 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)':
main.cpp:300:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
300 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)':
main.cpp:320:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
320 | for (int i = 0; i < connections.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::getMinimumDistances(int)':
main.cpp:386:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
386 | for (int i = 0; i < edges[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static bool Graph::isGraph(std::vector<int>)':
main.cpp:512:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
512 | if (edges > nodeDegrees.size() - 1)
| ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:570:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
570 | for (int i = 0; i < topologicalOrder.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 9ms | 184kb | Indicele unui nod nu se afla intre 1 si N | 0 |
2 | 1ms | 184kb | Indicele unui nod nu se afla intre 1 si N | 0 |
3 | 2ms | 184kb | Indicele unui nod nu se afla intre 1 si N | 0 |
4 | 1ms | 184kb | Indicele unui nod nu se afla intre 1 si N | 0 |
5 | 1ms | 184kb | Indicele unui nod nu se afla intre 1 si N | 0 |
6 | 10ms | 577kb | Indicele unui nod nu se afla intre 1 si N | 0 |
7 | 19ms | 1122kb | Indicele unui nod nu se afla intre 1 si N | 0 |
8 | 28ms | 1417kb | Indicele unui nod nu se afla intre 1 si N | 0 |
9 | 55ms | 2707kb | Indicele unui nod nu se afla intre 1 si N | 0 |
10 | 75ms | 3260kb | Indicele unui nod nu se afla intre 1 si N | 0 |
Punctaj total | 0 |