Pagini recente » Borderou de evaluare (job #251655) | Borderou de evaluare (job #2592401) | Borderou de evaluare (job #482622) | Borderou de evaluare (job #1915931) | Borderou de evaluare (job #2816430)
Borderou de evaluare (job #2816430)
Raport evaluator
Compilare:
main.cpp:251: warning: ignoring '#pragma region GraphClassImplementation' [-Wunknown-pragmas]
251 | #pragma region GraphClassImplementation
|
main.cpp:809: warning: ignoring '#pragma endregion EndGrapClassImplementation' [-Wunknown-pragmas]
809 | #pragma endregion EndGrapClassImplementation
|
main.cpp:945: warning: ignoring '#pragma region WeightedGraphClassImplementation' [-Wunknown-pragmas]
945 | #pragma region WeightedGraphClassImplementation
|
main.cpp:1333: warning: ignoring '#pragma endregion EndWeightedGraphClassImplementation' [-Wunknown-pragmas]
1333 | #pragma endregion EndWeightedGraphClassImplementation
|
main.cpp:1387: warning: ignoring '#pragma region FlowNetworkImplementation' [-Wunknown-pragmas]
1387 | #pragma region FlowNetworkImplementation
|
main.cpp:1498: warning: ignoring '#pragma endregion EndFlowNetworkImplementation' [-Wunknown-pragmas]
1498 | #pragma endregion EndFlowNetworkImplementation
|
main.cpp: In member function 'void Graph::printEdges(std::ostream&, bool)':
main.cpp:256:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
256 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::DFS(int, bool*)':
main.cpp:273:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
273 | 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:291:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
291 | 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:332:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
332 | 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:368:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
368 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::findTopologicalOrder(int, std::vector<int>&, bool*)':
main.cpp:396:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
396 | for (int i = 0; i < edges[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::setEdges(std::vector<std::vector<int> >)':
main.cpp:409:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
409 | for (int i = 0; i < connections.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'virtual std::vector<int> Graph::getMinimumDistances(int)':
main.cpp:473:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
473 | for (int i = 0; i < edges[currentNode].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 5 |
2 | 2ms | 184kb | OK | 5 |
3 | 2ms | 184kb | OK | 5 |
4 | 2ms | 184kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 6ms | 331kb | OK | 5 |
7 | 15ms | 4464kb | OK | 5 |
8 | 11ms | 4431kb | OK | 5 |
9 | 69ms | 1118kb | OK | 5 |
10 | 69ms | 1118kb | OK | 5 |
11 | 74ms | 1187kb | OK | 5 |
12 | 74ms | 1142kb | OK | 5 |
13 | 73ms | 1118kb | OK | 5 |
14 | 74ms | 1146kb | OK | 5 |
15 | 752ms | 19136kb | Time limit exceeded | 0 |
16 | 753ms | 19161kb | Time limit exceeded | 0 |
17 | 669ms | 19099kb | OK | 5 |
18 | 752ms | 19095kb | Time limit exceeded | 0 |
19 | 754ms | 19120kb | Time limit exceeded | 0 |
20 | 752ms | 19079kb | Time limit exceeded | 0 |
Punctaj total | 75 |