Pagini recente » Borderou de evaluare (job #12856) | Borderou de evaluare (job #55958) | Borderou de evaluare (job #2010800) | Borderou de evaluare (job #2444720) | Borderou de evaluare (job #3300862)
Borderou de evaluare (job #3300862)
Raport evaluator
Compilare:
main.cpp: In function 'DijkstraResult Dijkstra(int)':
main.cpp:13:27: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
13 | #define infinity ((1<<31) - 1)
| ~~~~~~~~^~~
main.cpp:40:48: note: in expansion of macro 'infinity'
40 | vector<int> distances(number_of_nodes + 1, infinity);
| ^~~~~~~~
main.cpp:55:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for(int j = 0; j < adj[current_node].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:13:27: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
13 | #define infinity ((1<<31) - 1)
| ~~~~~~~~^~~
main.cpp:106:25: note: in expansion of macro 'infinity'
106 | long long minCost = infinity;
| ^~~~~~~~
main.cpp:13:27: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
13 | #define infinity ((1<<31) - 1)
| ~~~~~~~~^~~
main.cpp:110:34: note: in expansion of macro 'infinity'
110 | if (resA.distances[i] != infinity && resB.distances[i] != infinity && resC.distances[i] != infinity)
| ^~~~~~~~
main.cpp:13:27: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
13 | #define infinity ((1<<31) - 1)
| ~~~~~~~~^~~
main.cpp:110:67: note: in expansion of macro 'infinity'
110 | if (resA.distances[i] != infinity && resB.distances[i] != infinity && resC.distances[i] != infinity)
| ^~~~~~~~
main.cpp:13:27: warning: integer overflow in expression of type 'int' results in '2147483647' [-Woverflow]
13 | #define infinity ((1<<31) - 1)
| ~~~~~~~~^~~
main.cpp:110:100: note: in expansion of macro 'infinity'
110 | if (resA.distances[i] != infinity && resB.distances[i] != infinity && resC.distances[i] != infinity)
| ^~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 5ms | 397kb | Killed by Signal 11 | 0 | 0 |
| 11 | 8ms | 405kb | Killed by Signal 11 | 0 |
| 2 | 8ms | 405kb | Killed by Signal 11 | 0 | 0 |
| 12 | 8ms | 401kb | Killed by Signal 11 | 0 |
| 3 | 9ms | 507kb | Killed by Signal 11 | 0 | 0 |
| 13 | 11ms | 901kb | Killed by Signal 11 | 0 |
| 4 | 9ms | 507kb | Killed by Signal 11 | 0 | 0 |
| 14 | 9ms | 618kb | Killed by Signal 11 | 0 |
| 5 | 9ms | 577kb | Killed by Signal 11 | 0 | 0 |
| 15 | 10ms | 708kb | Killed by Signal 11 | 0 |
| 6 | 95ms | 10915kb | Killed by Signal 11 | 0 | 0 |
| 16 | 0ms | 397kb | Killed by Signal 11 | 0 |
| 7 | 72ms | 9826kb | Killed by Signal 11 | 0 | 0 |
| 17 | 0ms | 405kb | Killed by Signal 11 | 0 |
| 8 | 59ms | 9105kb | Killed by Signal 11 | 0 | 0 |
| 18 | 34ms | 6844kb | Killed by Signal 11 | 0 |
| 9 | 84ms | 10645kb | Killed by Signal 11 | 0 | 0 |
| 19 | 30ms | 6574kb | Killed by Signal 11 | 0 |
| 10 | 95ms | 10989kb | Killed by Signal 11 | 0 | 0 |
| 20 | 30ms | 6598kb | Killed by Signal 11 | 0 |
| Punctaj total | 0 |