Pagini recente » Borderou de evaluare (job #442226) | Borderou de evaluare (job #423390) | Borderou de evaluare (job #2610637) | Borderou de evaluare (job #1740953) | Borderou de evaluare (job #996090)
Borderou de evaluare (job #996090)
Raport evaluator
Compilare:
user.cpp: In function ‘void sift(short int)’:
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
#define F2 F1+1
^
user.cpp:34:55: note: in expansion of macro ‘F2’
if(c[HEAP[nod]]>c[HEAP[F1]] && (c[HEAP[F1]]<=c[HEAP[F2]] || (F1<=L && F2>L)))
^
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
#define F2 F1+1
^
user.cpp:34:73: note: in expansion of macro ‘F2’
if(c[HEAP[nod]]>c[HEAP[F1]] && (c[HEAP[F1]]<=c[HEAP[F2]] || (F1<=L && F2>L)))
^
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
#define F2 F1+1
^
user.cpp:40:26: note: in expansion of macro ‘F2’
if(c[HEAP[nod]]>c[HEAP[F2]] && c[HEAP[F1]]>c[HEAP[F2]] && F2<=L)
^
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
#define F2 F1+1
^
user.cpp:40:53: note: in expansion of macro ‘F2’
if(c[HEAP[nod]]>c[HEAP[F2]] && c[HEAP[F1]]>c[HEAP[F2]] && F2<=L)
^
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
#define F2 F1+1
^
user.cpp:40:61: note: in expansion of macro ‘F2’
if(c[HEAP[nod]]>c[HEAP[F2]] && c[HEAP[F1]]>c[HEAP[F2]] && F2<=L)
^
user.cpp:6:15: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
#define F1 nod<<1
^
user.cpp:7:12: note: in expansion of macro ‘F1’
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 516kb | OK | 5 |
| 2 | 0ms | 512kb | OK | 5 |
| 3 | 0ms | 512kb | OK | 5 |
| 4 | 0ms | 516kb | OK | 5 |
| 5 | 0ms | 516kb | Incorect | 0 |
| 6 | 0ms | 516kb | Incorect | 0 |
| 7 | 4ms | 528kb | Incorect | 0 |
| 8 | 4ms | 540kb | OK | 5 |
| 9 | 4ms | 536kb | Incorect | 0 |
| 10 | 4ms | 532kb | Incorect | 0 |
| 11 | 4ms | 560kb | Incorect | 0 |
| 12 | 4ms | 552kb | Incorect | 0 |
| 13 | 4ms | 572kb | OK | 5 |
| 14 | 4ms | 572kb | Incorect | 0 |
| 15 | 4ms | 576kb | Incorect | 0 |
| 16 | 4ms | 572kb | Incorect | 0 |
| 17 | 4ms | 592kb | Incorect | 0 |
| 18 | 4ms | 612kb | Incorect | 0 |
| 19 | 8ms | Depăşit | Memory limit exceeded. | 0 |
| 20 | 8ms | Depăşit | Memory limit exceeded. | 0 |
| Punctaj total | 30 |
Stoin Raul raulstoin