Pagini recente » Borderou de evaluare (job #867650) | Borderou de evaluare (job #681777) | Borderou de evaluare (job #1996230) | Borderou de evaluare (job #1172247) | Borderou de evaluare (job #3145503)
Borderou de evaluare (job #3145503)
Raport evaluator
Compilare:
main.cpp: In function 'int BellmanFord(int, int, int, int)':
main.cpp:39:17: warning: narrowing conversion of 'start' from 'int' to 'char' [-Wnarrowing]
39 | q.push({start, w});
| ^~~~~
main.cpp:39:24: warning: narrowing conversion of 'w' from 'int' to 'short int' [-Wnarrowing]
39 | q.push({start, w});
| ^
main.cpp:45:31: warning: array subscript has type 'char' [-Wchar-subscripts]
45 | in_queue[node.node] = false;
| ~~~~~^~~~
main.cpp:47:47: warning: array subscript has type 'char' [-Wchar-subscripts]
47 | for(auto neighbour: edge[node.node])
| ~~~~~^~~~
main.cpp:48:76: warning: array subscript has type 'char' [-Wchar-subscripts]
48 | if(node.watts >= neighbour.cost && (timp[neighbour.node] > timp[node.node] + neighbour.time ||
| ~~~~~~~~~~^~~~
main.cpp:48:94: warning: array subscript has type 'char' [-Wchar-subscripts]
48 | if(node.watts >= neighbour.cost && (timp[neighbour.node] > timp[node.node] + neighbour.time ||
| ~~~~~^~~~
main.cpp:49:77: warning: array subscript has type 'char' [-Wchar-subscripts]
49 | (timp[neighbour.node] == timp[node.node] + neighbour.time &&
| ~~~~~~~~~~^~~~
main.cpp:49:96: warning: array subscript has type 'char' [-Wchar-subscripts]
49 | (timp[neighbour.node] == timp[node.node] + neighbour.time &&
| ~~~~~^~~~
main.cpp:50:108: warning: array subscript has type 'char' [-Wchar-subscripts]
50 | node.watts - neighbour.cost > watts[neighbour.node]))){
| ~~~~~~~~~~^~~~
main.cpp:51:48: warning: array subscript has type 'char' [-Wchar-subscripts]
51 | timp[neighbour.node] = timp[node.node] + neighbour.time;
| ~~~~~~~~~~^~~~
main.cpp:51:66: warning: array subscript has type 'char' [-Wchar-subscripts]
51 | timp[neighbour.node] = timp[node.node] + neighbour.time;
| ~~~~~^~~~
main.cpp:53:56: warning: array subscript has type 'char' [-Wchar-subscripts]
53 | if(!in_queue[neighbour.node]){
| ~~~~~~~~~~^~~~
main.cpp:54:60: warning: array subscript has type 'char' [-Wchar-subscripts]
54 | in_queue[neighbour.node] = true;
| ~~~~~~~~~~^~~~
main.cpp:55:63: warning: array subscript has type 'char' [-Wchar-subscripts]
55 | if(friendly[neighbour.node])
| ~~~~~~~~~~^~~~
main.cpp:56:73: warning: narrowing conversion of 'w' from 'int' to 'short int' [-Wnarrowing]
56 | q.push({neighbour.node, w});
| ^
main.cpp:58:84: warning: narrowing conversion of '(((int)node.BellmanFord(int, int, int, int)::Node::watts) - ((int)neighbour.Edge::cost))' from 'int' to 'short int' [-Wnarrowing]
58 | q.push({neighbour.node, node.watts - neighbour.cost});
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 303kb | OK | 10 |
2 | 0ms | 303kb | Incorect | 0 |
3 | 0ms | 303kb | OK | 10 |
4 | 0ms | 303kb | Incorect | 0 |
5 | 0ms | 303kb | Incorect | 0 |
6 | 0ms | 303kb | Incorect | 0 |
7 | 0ms | 303kb | Incorect | 0 |
8 | 0ms | 303kb | OK | 10 |
9 | 0ms | 303kb | Incorect | 0 |
10 | 0ms | 303kb | Incorect | 0 |
Punctaj total | 30 |