Pagini recente » Borderou de evaluare (job #1756246) | Borderou de evaluare (job #2916758) | Borderou de evaluare (job #393779) | Borderou de evaluare (job #1124641) | Borderou de evaluare (job #2812440)
Borderou de evaluare (job #2812440)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&, int)':
main.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
86 | for(int i = 0; i<Ad[node].size(); ++i)
| ~^~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::BFS(int, std::vector<int>&)':
main.cpp:111:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
111 | for(int i = 0; i<Ad[parent].size(); ++i)
| ~^~~~~~~~~~~~~~~~~~
main.cpp:104:17: warning: unused variable 'distance' [-Wunused-variable]
104 | int parent, distance;
| ^~~~~~~~
main.cpp: In member function 'void Graph::topSortDFS(int, std::vector<int>&, std::stack<int>&)':
main.cpp:128:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
128 | for(int i = 0; i<Ad[node].size(); ++i)
| ~^~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::tuple<int, int, int> > Graph::getMST()':
main.cpp:184:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edgeCost>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
184 | for(int j = 0; j<AdCost[i].size(); ++i)
| ~^~~~~~~~~~~~~~~~~
main.cpp:188:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
188 | for(int i = 0; i<edges.size() && solSize < n-1; ++i){
| ~^~~~~~~~~~~~~
main.cpp:177:22: warning: unused variable 'cost' [-Wunused-variable]
177 | int solSize = 0, cost = 0;
| ^~~~
main.cpp:178:11: warning: unused variable 'm' [-Wunused-variable]
178 | int n,m,x,y,c;
| ^
main.cpp:178:17: warning: unused variable 'c' [-Wunused-variable]
178 | int n,m,x,y,c;
| ^
main.cpp: In member function 'void Graph::dfsSCC(int, int&, std::vector<int>&, std::vector<int>&, std::vector<bool>&, std::stack<int>&, std::vector<std::vector<int> >&)':
main.cpp:204:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
204 | for(int i = 0; i<Ad[node].size(); ++i){
| ~^~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfsBCC(int, int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)':
main.cpp:244:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
244 | for(int i = 0; i<Ad[node].size(); ++i){
| ~^~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::bellman(bool&, std::vector<int>&, int)':
main.cpp:300:25: 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<Ad[currentNode].size(); ++i){
| ~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dijkstra(std::vector<int>&, int)':
main.cpp:349:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
349 | for(int i = 0; i < Ad[currentNode].size(); ++i){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::getDijkstraDistance(int)':
main.cpp:371:1: warning: no return statement in function returning non-void [-Wreturn-type]
371 | }
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 184kb | OK | 10 | 10 |
2 | 2ms | 184kb | OK | 10 | 10 |
3 | 2ms | 184kb | OK | 10 | 10 |
4 | 2ms | 184kb | OK | 10 | 10 |
5 | 2ms | 184kb | OK | 10 | 10 |
6 | 2ms | 184kb | Incorect | 0 | 0 |
7 | 6ms | 950kb | OK | 10 | 10 |
8 | 54ms | 2240kb | OK | 10 | 0 |
9 | 64ms | 3641kb | Time limit exceeded | 0 |
10 | 64ms | 4321kb | Time limit exceeded | 0 |
Punctaj total | 60 |