Pagini recente » Borderou de evaluare (job #2822361) | Borderou de evaluare (job #2133671) | Borderou de evaluare (job #1476966) | Borderou de evaluare (job #2534935) | Borderou de evaluare (job #2958551)
Borderou de evaluare (job #2958551)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::printAdjList(std::ostream&) const':
main.cpp:89:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | for(int j = 0; j < adjList[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::_DFSUtil(std::vector<int>&, std::vector<bool>&, int, bool)':
main.cpp:109:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
109 | for(int j = 0; j < adjList[currentNode].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::addEdge(int, int, double, bool)':
main.cpp:172:37: warning: comparison of integer expressions of different signedness: 'const int' and 'std::vector<std::vector<std::pair<int, double> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
172 | if(max(source, destination) >= adjList.size()) {
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
main.cpp:181:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
181 | for(int pos = 0; pos < adjList[source].size(); ++pos) {
| ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:218:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, double> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
218 | if(destination >= adjList.size()) {
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
main.cpp:226:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
226 | for(int pos = 0; pos < adjList[destination].size(); ++pos) {
| ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graph::NodeInfoContainer<double> Graph::dijkstra(int)':
main.cpp:345:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
345 | for(int j = 0; j < adjList[nearestNode].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:336:18: warning: unused variable 'nearestNodeDistance' [-Wunused-variable]
336 | auto nearestNodeDistance = q.top().first;
| ^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graph::NodeInfoContainer<int> Graph::topologicalSort(bool)':
main.cpp:484:13: warning: unused variable 'sourceNode' [-Wunused-variable]
484 | int sourceNode = this->Opts.zeroIndexed ? 0 : 1;
| ^~~~~~~~~~
main.cpp: In member function 'Graph::NodeInfoContainer<int> Graph::BFS(int)':
main.cpp:521:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
521 | for(int j = 0; j < adjList[currentNode].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 184kb | OK | 10 |
2 | 0ms | 184kb | OK | 10 |
3 | 0ms | 184kb | OK | 10 |
4 | 0ms | 184kb | OK | 10 |
5 | 0ms | 184kb | OK | 10 |
6 | 0ms | 184kb | OK | 10 |
7 | 3ms | 950kb | OK | 10 |
8 | 8ms | 1667kb | OK | 10 |
9 | 23ms | 3502kb | OK | 10 |
10 | 42ms | 4878kb | OK | 10 |
Punctaj total | 100 |