Pagini recente » Borderou de evaluare (job #1144704) | Borderou de evaluare (job #934169) | Borderou de evaluare (job #1000901) | Borderou de evaluare (job #132705) | Borderou de evaluare (job #1155796)
Borderou de evaluare (job #1155796)
Raport evaluator
Compilare:
user.cpp: In function ‘void create_tree(int, int, int)’:
user.cpp:45:81: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(v[tree[2*nod]] > v[tree[2*nod+1]] || v[tree[2*nod]] == v[tree[2*nod+1]] && tree[2*nod] < tree[2*nod+1])
^
user.cpp: In function ‘void update_tree(int, int, int, int)’:
user.cpp:61:81: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(v[tree[2*nod]] > v[tree[2*nod+1]] || v[tree[2*nod]] == v[tree[2*nod+1]] && tree[2*nod] < tree[2*nod+1] )
^
user.cpp: In function ‘int query(int, int, int, int, int)’:
user.cpp:79:36: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(v[l] > v[r] || v[l] == v[r] && l < r)
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | Depăşit | 572kb | Time limit exceeded. | 0 |
| 2 | 32ms | 880kb | Incorect | 0 |
| 3 | 1168ms | 3508kb | Incorect | 0 |
| 4 | 1576ms | 4396kb | Incorect | 0 |
| 5 | Depăşit | 6240kb | Time limit exceeded. | 0 |
| 6 | Depăşit | 6812kb | Time limit exceeded. | 0 |
| 7 | 1668ms | 8392kb | Incorect | 0 |
| 8 | Depăşit | 15632kb | Time limit exceeded. | 0 |
| 9 | 472ms | 16148kb | Killed by signal 11(SIGSEGV). | 0 |
| 10 | 304ms | 15916kb | Killed by signal 11(SIGSEGV). | 0 |
| Punctaj total | 0 |
Berbecariu Flaviu SpiriFlaviu