Detalii evaluare #11393392

Rezumat problemă

Detalii

Problema trenbus Operații I/O trenbus.in/trenbus.out
Limita timp 3 secunde Limita memorie Total: 512 MB / Stivă 512 MB
Id soluție #11393392 Utilizator Paul Andrei (Paul_Andrei)
Fișier trenbus.cpp Dimensiune 7.53 KB
Data încărcării 27 Octombrie 2018, 13:22 Scor / rezultat 100 puncte

Evaluare


Mesaj compilare

trenbus.cpp: In member function 'void Tree::dfs_cb(int, CB) [with CB = Tree::split(int, CB) [with CB = main()::__lambda4]::__lambda2]':
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp: In member function 'void Tree::dfs_cb(int, CB) [with CB = Tree::join(int, int, int, CB) [with CB = main()::__lambda3]::__lambda1]':
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^
trenbus.cpp: In function 'int main()':
trenbus.cpp:32:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
         if (new_value < old_value) { // lost some stuff

         ^

Rezultat evaluare

Test Timp Mesaj evaluare Scor posibil Scor obținut
1 0.116 secunde OK. 4 4
2 0.052 secunde OK. 4 4
3 0.312 secunde OK. 4 4
4 0.156 secunde OK. 4 4
5 0.192 secunde OK. 4 4
6 0.168 secunde OK. 4 4
7 0.16 secunde OK. 4 4
8 0.656 secunde OK. 4 4
9 0.28 secunde OK. 4 4
10 0.34 secunde OK. 4 4
11 0.272 secunde OK. 4 4
12 0.28 secunde OK. 4 4
13 0.248 secunde OK. 4 4
14 0.304 secunde OK. 4 4
15 0.128 secunde OK. 4 4
16 0.116 secunde OK. 5 5
17 0.12 secunde OK. 5 5
18 0.552 secunde OK. 5 5
19 0.3 secunde OK. 5 5
20 0.276 secunde OK. 5 5
21 0.216 secunde OK. 5 5
22 0.236 secunde OK. 10 10
Punctaj total 100

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

  • probleme la care rezolvarea presupune scrierea unui program complet
  • probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema trenbus face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

  • Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.