Pagini recente » Borderou de evaluare (job #667145) | Borderou de evaluare (job #1354613) | Borderou de evaluare (job #1847092) | Borderou de evaluare (job #382164) | Borderou de evaluare (job #2816417)
Borderou de evaluare (job #2816417)
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:1336: warning: ignoring '#pragma endregion EndWeightedGraphClassImplementation' [-Wunknown-pragmas]
1336 | #pragma endregion EndWeightedGraphClassImplementation
|
main.cpp:1390: warning: ignoring '#pragma region FlowNetworkImplementation' [-Wunknown-pragmas]
1390 | #pragma region FlowNetworkImplementation
|
main.cpp:1501: warning: ignoring '#pragma endregion EndFlowNetworkImplementation' [-Wunknown-pragmas]
1501 | #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 | Incorect | 0 |
3 | 2ms | 184kb | Incorect | 0 |
4 | 2ms | 184kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 6ms | 331kb | OK | 5 |
7 | 25ms | 4464kb | Incorect | 0 |
8 | 11ms | 4435kb | Incorect | 0 |
9 | 98ms | 1179kb | OK | 5 |
10 | 98ms | 1118kb | OK | 5 |
11 | 103ms | 1171kb | OK | 5 |
12 | 107ms | 1187kb | OK | 5 |
13 | 107ms | 1187kb | OK | 5 |
14 | 103ms | 1069kb | OK | 5 |
15 | 751ms | 19075kb | Time limit exceeded | 0 |
16 | 753ms | 19169kb | Time limit exceeded | 0 |
17 | 754ms | 19099kb | Time limit exceeded | 0 |
18 | 752ms | 19124kb | Time limit exceeded | 0 |
19 | 751ms | 19099kb | Time limit exceeded | 0 |
20 | 752ms | 19062kb | Time limit exceeded | 0 |
Punctaj total | 50 |