Pagini recente » Borderou de evaluare (job #367833) | Borderou de evaluare (job #2537594) | Borderou de evaluare (job #2912412) | Borderou de evaluare (job #163768) | Borderou de evaluare (job #3300864)
Borderou de evaluare (job #3300864)
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:41:43: note: in expansion of macro 'infinity'
41 | distances.resize(number_of_nodes + 1, infinity);
| ^~~~~~~~
main.cpp:56: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]
56 | 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:111:25: note: in expansion of macro 'infinity'
111 | 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:115:34: note: in expansion of macro 'infinity'
115 | 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:115:67: note: in expansion of macro 'infinity'
115 | 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:115:100: note: in expansion of macro 'infinity'
115 | if (resA.distances[i] != infinity && resB.distances[i] != infinity && resC.distances[i] != infinity)
| ^~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 303kb | Corect | 5 | 10 |
11 | 0ms | 303kb | Corect | 5 |
2 | 0ms | 303kb | Corect | 5 | 10 |
12 | 0ms | 303kb | Corect | 5 |
3 | 1ms | 303kb | Corect | 5 | 10 |
13 | 4ms | 819kb | Corect | 5 |
4 | 1ms | 303kb | Cost prea mare | 0 | 0 |
14 | 2ms | 557kb | Corect | 5 |
5 | 1ms | 557kb | Cost prea mare | 0 | 0 |
15 | 2ms | 557kb | Corect | 5 |
6 | 206ms | 13832kb | Cost prea mare | 0 | 0 |
16 | 0ms | 303kb | Corect | 5 |
7 | 173ms | 13156kb | Cost prea mare | 0 | 0 |
17 | 0ms | 303kb | Corect | 5 |
8 | 160ms | 12935kb | Cost prea mare | 0 | 0 |
18 | 88ms | 66924kb | Memory limit exceeded | 0 |
9 | 195ms | 13860kb | Cost prea mare | 0 | 0 |
19 | 83ms | 66260kb | Memory limit exceeded | 0 |
10 | 209ms | 14147kb | Cost prea mare | 0 | 0 |
20 | 80ms | 66723kb | Memory limit exceeded | 0 |
Punctaj total | 30 |