Borderou de evaluare (job #3300864)

Utilizator IustinSoadMitu Iustin IustinSoad Data 19 iunie 2025 16:28:23
Problema Trilant Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 30

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
10ms303kbCorect510
110ms303kbCorect5
20ms303kbCorect510
120ms303kbCorect5
31ms303kbCorect510
134ms819kbCorect5
41ms303kbCost prea mare00
142ms557kbCorect5
51ms557kbCost prea mare00
152ms557kbCorect5
6206ms13832kbCost prea mare00
160ms303kbCorect5
7173ms13156kbCost prea mare00
170ms303kbCorect5
8160ms12935kbCost prea mare00
1888ms66924kbMemory limit exceeded0
9195ms13860kbCost prea mare00
1983ms66260kbMemory limit exceeded0
10209ms14147kbCost prea mare00
2080ms66723kbMemory limit exceeded0
Punctaj total30

Ceva nu functioneaza?